./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/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_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/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_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/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_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/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-aa41828 [2018-11-23 06:26:52,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:26:52,173 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:26:52,181 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:26:52,181 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:26:52,182 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:26:52,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:26:52,184 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:26:52,185 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:26:52,185 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:26:52,186 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:26:52,186 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:26:52,187 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:26:52,187 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:26:52,188 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:26:52,189 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:26:52,189 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:26:52,190 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:26:52,192 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:26:52,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:26:52,194 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:26:52,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:26:52,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:26:52,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:26:52,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:26:52,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:26:52,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:26:52,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:26:52,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:26:52,198 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:26:52,198 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:26:52,199 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:26:52,199 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:26:52,199 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:26:52,199 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:26:52,200 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:26:52,200 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-23 06:26:52,208 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:26:52,208 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:26:52,209 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:26:52,209 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:26:52,209 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 06:26:52,209 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 06:26:52,209 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 06:26:52,210 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 06:26:52,210 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 06:26:52,210 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 06:26:52,210 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 06:26:52,210 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 06:26:52,210 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 06:26:52,211 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:26:52,211 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:26:52,211 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:26:52,211 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:26:52,211 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:26:52,211 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:26:52,212 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:26:52,212 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:26:52,212 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 06:26:52,212 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 06:26:52,212 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 06:26:52,212 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:26:52,212 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:26:52,212 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:26:52,213 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:26:52,213 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:26:52,213 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:26:52,213 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:26:52,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:26:52,213 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:26:52,213 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:26:52,214 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 06:26:52,214 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:26:52,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:26:52,214 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_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/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-11-23 06:26:52,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:26:52,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:26:52,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:26:52,251 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:26:52,251 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:26:52,252 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 06:26:52,290 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/data/af9b29652/f76b63f3ae5e4a0f94ab1c25f372f225/FLAG49c705e9d [2018-11-23 06:26:52,626 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:26:52,626 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 06:26:52,633 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/data/af9b29652/f76b63f3ae5e4a0f94ab1c25f372f225/FLAG49c705e9d [2018-11-23 06:26:52,642 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/data/af9b29652/f76b63f3ae5e4a0f94ab1c25f372f225 [2018-11-23 06:26:52,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:26:52,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:26:52,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:26:52,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:26:52,648 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:26:52,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:26:52" (1/1) ... [2018-11-23 06:26:52,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e1a27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:26:52, skipping insertion in model container [2018-11-23 06:26:52,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:26:52" (1/1) ... [2018-11-23 06:26:52,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:26:52,688 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:26:52,871 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:26:52,878 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:26:52,950 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:26:52,974 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:26:52,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:26:52 WrapperNode [2018-11-23 06:26:52,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:26:52,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:26:52,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:26:52,975 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:26:52,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:26:52" (1/1) ... [2018-11-23 06:26:52,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:26:52" (1/1) ... [2018-11-23 06:26:52,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:26:52,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:26:52,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:26:52,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:26:53,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:26:52" (1/1) ... [2018-11-23 06:26:53,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:26:52" (1/1) ... [2018-11-23 06:26:53,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:26:52" (1/1) ... [2018-11-23 06:26:53,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:26:52" (1/1) ... [2018-11-23 06:26:53,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:26:52" (1/1) ... [2018-11-23 06:26:53,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:26:52" (1/1) ... [2018-11-23 06:26:53,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:26:52" (1/1) ... [2018-11-23 06:26:53,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:26:53,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:26:53,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:26:53,029 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:26:53,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:26:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/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-11-23 06:26:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:26:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:26:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:26:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:26:53,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:26:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:26:53,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:26:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 06:26:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 06:26:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:26:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:26:53,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:26:53,503 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:26:53,503 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-11-23 06:26:53,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:26:53 BoogieIcfgContainer [2018-11-23 06:26:53,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:26:53,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:26:53,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:26:53,507 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:26:53,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:26:52" (1/3) ... [2018-11-23 06:26:53,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd0971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:26:53, skipping insertion in model container [2018-11-23 06:26:53,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:26:52" (2/3) ... [2018-11-23 06:26:53,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd0971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:26:53, skipping insertion in model container [2018-11-23 06:26:53,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:26:53" (3/3) ... [2018-11-23 06:26:53,509 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 06:26:53,516 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:26:53,521 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-11-23 06:26:53,532 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-11-23 06:26:53,551 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:26:53,551 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 06:26:53,551 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:26:53,551 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:26:53,551 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:26:53,551 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:26:53,551 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:26:53,551 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:26:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-11-23 06:26:53,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 06:26:53,571 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:53,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:26:53,574 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:53,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:53,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1288008672, now seen corresponding path program 1 times [2018-11-23 06:26:53,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:53,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:53,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:53,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:53,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:53,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:53,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:26:53,681 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:53,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:26:53,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:26:53,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:26:53,695 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2018-11-23 06:26:53,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:53,863 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2018-11-23 06:26:53,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:26:53,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 06:26:53,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:53,871 INFO L225 Difference]: With dead ends: 171 [2018-11-23 06:26:53,871 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 06:26:53,872 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-11-23 06:26:53,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 06:26:53,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2018-11-23 06:26:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 06:26:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 148 transitions. [2018-11-23 06:26:53,905 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 148 transitions. Word has length 7 [2018-11-23 06:26:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:53,906 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 148 transitions. [2018-11-23 06:26:53,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:26:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 148 transitions. [2018-11-23 06:26:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 06:26:53,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:53,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:26:53,907 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:53,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:53,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1288008673, now seen corresponding path program 1 times [2018-11-23 06:26:53,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:53,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:53,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:53,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:53,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:53,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:53,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:26:53,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:53,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:26:53,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:26:53,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:26:53,962 INFO L87 Difference]: Start difference. First operand 143 states and 148 transitions. Second operand 3 states. [2018-11-23 06:26:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:54,063 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2018-11-23 06:26:54,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:26:54,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 06:26:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:54,064 INFO L225 Difference]: With dead ends: 140 [2018-11-23 06:26:54,064 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 06:26:54,065 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-11-23 06:26:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 06:26:54,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-11-23 06:26:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 06:26:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 145 transitions. [2018-11-23 06:26:54,072 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 145 transitions. Word has length 7 [2018-11-23 06:26:54,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:54,072 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 145 transitions. [2018-11-23 06:26:54,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:26:54,072 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 145 transitions. [2018-11-23 06:26:54,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 06:26:54,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:54,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:26:54,073 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:54,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:54,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1021398364, now seen corresponding path program 1 times [2018-11-23 06:26:54,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:54,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:54,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:54,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:54,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:54,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:54,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:26:54,119 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:54,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:26:54,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:26:54,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:26:54,120 INFO L87 Difference]: Start difference. First operand 140 states and 145 transitions. Second operand 3 states. [2018-11-23 06:26:54,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:54,204 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2018-11-23 06:26:54,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:26:54,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 06:26:54,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:54,205 INFO L225 Difference]: With dead ends: 139 [2018-11-23 06:26:54,205 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 06:26:54,206 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-11-23 06:26:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 06:26:54,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-11-23 06:26:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 06:26:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-11-23 06:26:54,211 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 11 [2018-11-23 06:26:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:54,211 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-11-23 06:26:54,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:26:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-11-23 06:26:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 06:26:54,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:54,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:26:54,212 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:54,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:54,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1021398363, now seen corresponding path program 1 times [2018-11-23 06:26:54,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:54,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:54,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:54,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:54,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:54,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:54,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:26:54,253 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:54,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:26:54,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:26:54,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:26:54,254 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 3 states. [2018-11-23 06:26:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:54,341 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2018-11-23 06:26:54,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:26:54,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 06:26:54,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:54,342 INFO L225 Difference]: With dead ends: 148 [2018-11-23 06:26:54,342 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 06:26:54,342 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-11-23 06:26:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 06:26:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2018-11-23 06:26:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 06:26:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2018-11-23 06:26:54,351 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 11 [2018-11-23 06:26:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:54,352 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-11-23 06:26:54,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:26:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2018-11-23 06:26:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 06:26:54,352 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:54,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:26:54,353 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:54,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:54,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1511446413, now seen corresponding path program 1 times [2018-11-23 06:26:54,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:54,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:54,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:54,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:54,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:54,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:54,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:26:54,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:54,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:26:54,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:26:54,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:26:54,409 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 4 states. [2018-11-23 06:26:54,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:54,540 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-23 06:26:54,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:26:54,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 06:26:54,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:54,541 INFO L225 Difference]: With dead ends: 140 [2018-11-23 06:26:54,541 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 06:26:54,541 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-11-23 06:26:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 06:26:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2018-11-23 06:26:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 06:26:54,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-11-23 06:26:54,545 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 17 [2018-11-23 06:26:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:54,545 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-11-23 06:26:54,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:26:54,545 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-11-23 06:26:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 06:26:54,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:54,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:26:54,546 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:54,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:54,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1511446414, now seen corresponding path program 1 times [2018-11-23 06:26:54,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:54,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:54,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:54,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:54,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:54,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:54,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:26:54,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:54,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:26:54,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:26:54,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:26:54,597 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 4 states. [2018-11-23 06:26:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:54,741 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2018-11-23 06:26:54,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:26:54,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 06:26:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:54,743 INFO L225 Difference]: With dead ends: 160 [2018-11-23 06:26:54,743 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 06:26:54,743 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-11-23 06:26:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 06:26:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2018-11-23 06:26:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 06:26:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2018-11-23 06:26:54,747 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 17 [2018-11-23 06:26:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:54,747 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2018-11-23 06:26:54,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:26:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2018-11-23 06:26:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 06:26:54,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:54,748 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-11-23 06:26:54,749 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:54,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:54,750 INFO L82 PathProgramCache]: Analyzing trace with hash 801057136, now seen corresponding path program 1 times [2018-11-23 06:26:54,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:54,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:54,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:54,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:54,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:26:54,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:54,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:26:54,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:26:54,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:26:54,800 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 5 states. [2018-11-23 06:26:54,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:54,951 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2018-11-23 06:26:54,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:26:54,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 06:26:54,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:54,952 INFO L225 Difference]: With dead ends: 177 [2018-11-23 06:26:54,952 INFO L226 Difference]: Without dead ends: 177 [2018-11-23 06:26:54,953 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-11-23 06:26:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-23 06:26:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 134. [2018-11-23 06:26:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 06:26:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-11-23 06:26:54,957 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 19 [2018-11-23 06:26:54,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:54,958 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-11-23 06:26:54,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:26:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-11-23 06:26:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 06:26:54,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:54,959 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-11-23 06:26:54,959 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:54,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:54,959 INFO L82 PathProgramCache]: Analyzing trace with hash 801057137, now seen corresponding path program 1 times [2018-11-23 06:26:54,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:54,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:54,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:55,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:55,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:26:55,031 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:55,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:26:55,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:26:55,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:26:55,032 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 5 states. [2018-11-23 06:26:55,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:55,221 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-11-23 06:26:55,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:26:55,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 06:26:55,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:55,223 INFO L225 Difference]: With dead ends: 198 [2018-11-23 06:26:55,223 INFO L226 Difference]: Without dead ends: 198 [2018-11-23 06:26:55,223 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-11-23 06:26:55,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-23 06:26:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 133. [2018-11-23 06:26:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 06:26:55,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2018-11-23 06:26:55,228 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 19 [2018-11-23 06:26:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:55,228 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-11-23 06:26:55,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:26:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2018-11-23 06:26:55,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 06:26:55,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:55,229 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-11-23 06:26:55,229 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:55,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:55,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2144075406, now seen corresponding path program 1 times [2018-11-23 06:26:55,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:55,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:55,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:55,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:55,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:55,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:55,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 06:26:55,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:55,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 06:26:55,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 06:26:55,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:26:55,317 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 9 states. [2018-11-23 06:26:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:55,551 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-11-23 06:26:55,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:26:55,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 06:26:55,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:55,552 INFO L225 Difference]: With dead ends: 145 [2018-11-23 06:26:55,552 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 06:26:55,552 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-11-23 06:26:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 06:26:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2018-11-23 06:26:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 06:26:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-11-23 06:26:55,556 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 23 [2018-11-23 06:26:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:55,556 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-11-23 06:26:55,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 06:26:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-11-23 06:26:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 06:26:55,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:55,557 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-11-23 06:26:55,557 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:55,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:55,557 INFO L82 PathProgramCache]: Analyzing trace with hash -2144075405, now seen corresponding path program 1 times [2018-11-23 06:26:55,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:55,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:55,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:55,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:55,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:55,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:55,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 06:26:55,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:55,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 06:26:55,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 06:26:55,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 06:26:55,691 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 10 states. [2018-11-23 06:26:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:56,214 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-11-23 06:26:56,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 06:26:56,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 06:26:56,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:56,216 INFO L225 Difference]: With dead ends: 156 [2018-11-23 06:26:56,216 INFO L226 Difference]: Without dead ends: 156 [2018-11-23 06:26:56,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-11-23 06:26:56,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-23 06:26:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2018-11-23 06:26:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 06:26:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-11-23 06:26:56,218 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 23 [2018-11-23 06:26:56,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:56,218 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-11-23 06:26:56,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 06:26:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-11-23 06:26:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 06:26:56,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:56,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, 1] [2018-11-23 06:26:56,219 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:56,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:56,219 INFO L82 PathProgramCache]: Analyzing trace with hash -2060363479, now seen corresponding path program 1 times [2018-11-23 06:26:56,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:56,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:56,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:56,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:56,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:56,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:56,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 06:26:56,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:56,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:26:56,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:26:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:26:56,260 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 6 states. [2018-11-23 06:26:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:56,388 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-11-23 06:26:56,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:26:56,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-23 06:26:56,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:56,389 INFO L225 Difference]: With dead ends: 159 [2018-11-23 06:26:56,389 INFO L226 Difference]: Without dead ends: 159 [2018-11-23 06:26:56,389 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-11-23 06:26:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-23 06:26:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2018-11-23 06:26:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 06:26:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-11-23 06:26:56,391 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 26 [2018-11-23 06:26:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:56,391 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-11-23 06:26:56,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:26:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-11-23 06:26:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 06:26:56,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:56,392 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-11-23 06:26:56,392 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:56,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash -875183104, now seen corresponding path program 1 times [2018-11-23 06:26:56,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:56,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:56,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:56,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:56,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:56,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:26:56,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:26:56,476 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-23 06:26:56,478 INFO L202 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-11-23 06:26:56,501 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:26:56,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:26:56,624 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 06:26:56,625 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-11-23 06:26:56,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:56,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 06:26:56,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:26:56,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/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-11-23 06:26:56,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:56,642 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:26:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:56,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:26:56,694 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-11-23 06:26:56,698 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-11-23 06:26:56,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,719 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-11-23 06:26:56,723 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-11-23 06:26:56,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,730 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,734 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-23 06:26:56,741 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-11-23 06:26:56,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:26:56,754 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-11-23 06:26:56,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,766 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-11-23 06:26:56,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:26:56,771 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-11-23 06:26:56,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,780 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33 [2018-11-23 06:26:56,798 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-11-23 06:26:56,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:26:56,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:26:56,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:26:56,814 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-11-23 06:26:56,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,828 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-11-23 06:26:56,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:26:56,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:26:56,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:26:56,833 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-11-23 06:26:56,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,837 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2018-11-23 06:26:56,856 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-11-23 06:26:56,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:26:56,860 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-11-23 06:26:56,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,870 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-11-23 06:26:56,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:26:56,873 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-11-23 06:26:56,873 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,887 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-11-23 06:26:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:56,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:26:56,923 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:26:56,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:26:56,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,961 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,964 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:56,974 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:26:56,976 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:26:56,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 06:26:56,979 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:107, output treesize:25 [2018-11-23 06:26:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:57,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 06:26:57,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 8 [2018-11-23 06:26:57,015 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:26:57,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 06:26:57,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:26:57,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:26:57,016 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 8 states. [2018-11-23 06:26:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:57,318 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2018-11-23 06:26:57,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 06:26:57,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-23 06:26:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:57,319 INFO L225 Difference]: With dead ends: 190 [2018-11-23 06:26:57,319 INFO L226 Difference]: Without dead ends: 190 [2018-11-23 06:26:57,319 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-11-23 06:26:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-23 06:26:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 148. [2018-11-23 06:26:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-23 06:26:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-11-23 06:26:57,322 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 29 [2018-11-23 06:26:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:57,323 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-11-23 06:26:57,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 06:26:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-11-23 06:26:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 06:26:57,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:57,324 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-11-23 06:26:57,324 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:57,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1749861147, now seen corresponding path program 1 times [2018-11-23 06:26:57,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:57,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:57,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:57,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:57,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:57,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:57,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:26:57,387 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:57,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:26:57,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:26:57,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:26:57,388 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 5 states. [2018-11-23 06:26:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:57,516 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-11-23 06:26:57,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:26:57,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-23 06:26:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:57,517 INFO L225 Difference]: With dead ends: 151 [2018-11-23 06:26:57,517 INFO L226 Difference]: Without dead ends: 151 [2018-11-23 06:26:57,518 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-11-23 06:26:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-23 06:26:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2018-11-23 06:26:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 06:26:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-11-23 06:26:57,521 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 30 [2018-11-23 06:26:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:57,521 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-11-23 06:26:57,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:26:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-11-23 06:26:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 06:26:57,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:57,522 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-11-23 06:26:57,523 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:57,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1205351030, now seen corresponding path program 1 times [2018-11-23 06:26:57,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:57,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:57,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:57,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:57,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:57,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:57,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:26:57,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:57,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:26:57,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:26:57,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:26:57,559 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 5 states. [2018-11-23 06:26:57,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:57,710 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2018-11-23 06:26:57,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:26:57,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-23 06:26:57,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:57,711 INFO L225 Difference]: With dead ends: 210 [2018-11-23 06:26:57,711 INFO L226 Difference]: Without dead ends: 210 [2018-11-23 06:26:57,712 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-11-23 06:26:57,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-23 06:26:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 146. [2018-11-23 06:26:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 06:26:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-11-23 06:26:57,714 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 30 [2018-11-23 06:26:57,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:57,715 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-11-23 06:26:57,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:26:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-11-23 06:26:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 06:26:57,715 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:57,715 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-11-23 06:26:57,716 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:57,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:57,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1205351029, now seen corresponding path program 1 times [2018-11-23 06:26:57,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:57,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:57,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:57,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:57,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:57,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:57,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:26:57,777 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:57,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:26:57,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:26:57,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:26:57,778 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 5 states. [2018-11-23 06:26:57,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:57,932 INFO L93 Difference]: Finished difference Result 231 states and 247 transitions. [2018-11-23 06:26:57,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:26:57,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-23 06:26:57,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:57,932 INFO L225 Difference]: With dead ends: 231 [2018-11-23 06:26:57,932 INFO L226 Difference]: Without dead ends: 231 [2018-11-23 06:26:57,933 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-11-23 06:26:57,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-23 06:26:57,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 145. [2018-11-23 06:26:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 06:26:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-11-23 06:26:57,936 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 30 [2018-11-23 06:26:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:57,936 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-11-23 06:26:57,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:26:57,937 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-11-23 06:26:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 06:26:57,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:57,937 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-11-23 06:26:57,940 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:57,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:57,941 INFO L82 PathProgramCache]: Analyzing trace with hash 762632254, now seen corresponding path program 1 times [2018-11-23 06:26:57,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:57,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:57,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:57,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:57,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:26:57,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:57,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 06:26:57,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:57,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:26:57,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:26:57,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:26:57,993 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 6 states. [2018-11-23 06:26:58,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:58,095 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2018-11-23 06:26:58,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:26:58,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 06:26:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:58,096 INFO L225 Difference]: With dead ends: 158 [2018-11-23 06:26:58,096 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 06:26:58,096 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-11-23 06:26:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 06:26:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2018-11-23 06:26:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 06:26:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-11-23 06:26:58,099 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 31 [2018-11-23 06:26:58,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:58,099 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-11-23 06:26:58,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:26:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-11-23 06:26:58,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 06:26:58,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:58,100 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-11-23 06:26:58,100 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:58,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:58,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1658380276, now seen corresponding path program 1 times [2018-11-23 06:26:58,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:58,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:58,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:58,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:58,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:58,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:58,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:26:58,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:58,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 06:26:58,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:26:58,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:26:58,176 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 8 states. [2018-11-23 06:26:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:58,421 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-11-23 06:26:58,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:26:58,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-23 06:26:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:58,423 INFO L225 Difference]: With dead ends: 145 [2018-11-23 06:26:58,423 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 06:26:58,423 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-11-23 06:26:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 06:26:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-11-23 06:26:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 06:26:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2018-11-23 06:26:58,426 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 34 [2018-11-23 06:26:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:58,426 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2018-11-23 06:26:58,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 06:26:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-11-23 06:26:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 06:26:58,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:58,426 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-11-23 06:26:58,427 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:58,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:58,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1658380275, now seen corresponding path program 1 times [2018-11-23 06:26:58,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:58,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:58,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:58,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:58,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:58,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:26:58,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 06:26:58,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:58,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 06:26:58,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 06:26:58,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:26:58,527 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 9 states. [2018-11-23 06:26:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:58,781 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-23 06:26:58,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:26:58,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-23 06:26:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:58,782 INFO L225 Difference]: With dead ends: 140 [2018-11-23 06:26:58,782 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 06:26:58,783 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-11-23 06:26:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 06:26:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2018-11-23 06:26:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 06:26:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-11-23 06:26:58,785 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 34 [2018-11-23 06:26:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:58,785 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-11-23 06:26:58,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 06:26:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-11-23 06:26:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 06:26:58,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:58,786 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-11-23 06:26:58,786 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:58,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:58,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1359456605, now seen corresponding path program 1 times [2018-11-23 06:26:58,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:58,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:58,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:58,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:58,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:58,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:26:58,848 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:26:58,848 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-23 06:26:58,848 INFO L202 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-11-23 06:26:58,849 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:26:58,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:26:58,903 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 06:26:58,903 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-11-23 06:26:58,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:58,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 06:26:58,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:26:58,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/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-11-23 06:26:58,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:58,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:26:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:58,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:26:58,938 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-11-23 06:26:58,940 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-11-23 06:26:58,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:58,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:58,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:58,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-23 06:26:58,950 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-11-23 06:26:58,953 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-11-23 06:26:58,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:58,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:58,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:58,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-23 06:26:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:26:58,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:26:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:26:59,015 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:26:59,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2018-11-23 06:26:59,015 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:26:59,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:26:59,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:26:59,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:26:59,016 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 4 states. [2018-11-23 06:26:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:59,083 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-11-23 06:26:59,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:26:59,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 06:26:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:59,085 INFO L225 Difference]: With dead ends: 130 [2018-11-23 06:26:59,085 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 06:26:59,085 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-11-23 06:26:59,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 06:26:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2018-11-23 06:26:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 06:26:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-11-23 06:26:59,088 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 36 [2018-11-23 06:26:59,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:59,088 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-11-23 06:26:59,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:26:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-11-23 06:26:59,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 06:26:59,089 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:59,089 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-11-23 06:26:59,089 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:59,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:59,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1478819748, now seen corresponding path program 1 times [2018-11-23 06:26:59,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:59,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:59,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:59,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:59,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:59,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:26:59,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:26:59,231 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-23 06:26:59,232 INFO L202 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-11-23 06:26:59,233 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:26:59,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:26:59,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 06:26:59,289 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-11-23 06:26:59,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:59,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 06:26:59,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:26:59,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/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-11-23 06:26:59,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:59,301 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:26:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:26:59,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:26:59,340 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-11-23 06:26:59,345 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-11-23 06:26:59,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:59,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:59,364 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-11-23 06:26:59,365 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-11-23 06:26:59,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:59,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:59,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:59,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:3 [2018-11-23 06:26:59,414 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-11-23 06:26:59,415 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-11-23 06:26:59,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:59,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:59,421 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-11-23 06:26:59,427 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-11-23 06:26:59,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:26:59,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:59,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:26:59,432 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2018-11-23 06:26:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:26:59,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:26:59,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-11-23 06:26:59,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 06:26:59,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 20 [2018-11-23 06:26:59,558 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:26:59,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 06:26:59,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 06:26:59,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-11-23 06:26:59,559 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 14 states. [2018-11-23 06:26:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:26:59,860 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2018-11-23 06:26:59,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 06:26:59,861 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-23 06:26:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:26:59,861 INFO L225 Difference]: With dead ends: 162 [2018-11-23 06:26:59,861 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 06:26:59,862 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-11-23 06:26:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 06:26:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 135. [2018-11-23 06:26:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 06:26:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-11-23 06:26:59,864 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 37 [2018-11-23 06:26:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:26:59,864 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-11-23 06:26:59,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 06:26:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-11-23 06:26:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 06:26:59,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:26:59,865 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-11-23 06:26:59,865 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-11-23 06:26:59,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:26:59,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1401227515, now seen corresponding path program 1 times [2018-11-23 06:26:59,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:26:59,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:59,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:26:59,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:26:59,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:26:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:26:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:26:59,892 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=22, |#NULL.offset|=13, |old(#NULL.base)|=22, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=22, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=22, |old(#NULL.offset)|=13] [?] RET #286#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret21 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L988 VAL [main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L988-1 VAL [main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 8 + ~null~0.offset, 4); srcloc: L989 VAL [main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L993 VAL [main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 VAL [main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L994 VAL [main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] goto; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call #t~mem12 := read~int(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1031-3 VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0, |main_#t~mem12|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem12);havoc #t~mem12; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] goto; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1034 VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0, |main_#t~mem13|=1] [?] assume !(~unnamed1~0~RED == #t~mem13);havoc #t~mem13; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1034-2 VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0, |main_#t~mem16.base|=20, |main_#t~mem16.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume !!(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call #t~mem17 := read~int(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L1047 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0, |main_#t~mem17|=1] [?] assume !(~unnamed1~0~RED == #t~mem17);havoc #t~mem17; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~list~0.base, ~list~0.offset, 4); srcloc: L1056 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0, |main_#t~mem20.base|=20, |main_#t~mem20.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem20.base, #t~mem20.offset;havoc #t~mem20.base, #t~mem20.offset; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume 0 == ~list~0.offset; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume 0 == ~list~0.base || 1 == #valid[~list~0.base];call ULTIMATE.dealloc(~list~0.base, ~list~0.offset);~list~0.base, ~list~0.offset := ~end~0.base, ~end~0.offset; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume !(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] #res := 0; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#res|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume !(#valid == old(#valid)); VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#res|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=22, #NULL.offset=13, old(#NULL.base)=22, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L987] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L987] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L988] call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L989] call write~$Pointer$(0, 0, ~null~0.base, 4 + ~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L990] call write~int(~unnamed1~0~BLACK, ~null~0.base, 8 + ~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L992] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12); [L992] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L993] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L994] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L995] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~nondet2=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1000-L1024] assume !(0 != #t~nondet2); [L1000] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1031] call #t~mem12 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem12=1, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem12); [L1031] havoc #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1034] call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem13=1, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1034-L1039] assume !(~unnamed1~0~RED == #t~mem13); [L1034] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1041] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem16.base=20, #t~mem16.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1041] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset; [L1041] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1032-L1042] assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1045-L1060] assume !!(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1047] call #t~mem17 := read~int(~list~0.base, 8 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem17=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1047-L1059] assume !(~unnamed1~0~RED == #t~mem17); [L1047] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1056] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem20.base=20, #t~mem20.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1056] ~end~0.base, ~end~0.offset := #t~mem20.base, #t~mem20.offset; [L1056] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1057] assert 0 == ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1057] assert 0 == ~list~0.base || 1 == #valid[~list~0.base]; [L1057] call ULTIMATE.dealloc(~list~0.base, ~list~0.offset); [L1058] ~list~0.base, ~list~0.offset := ~end~0.base, ~end~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1045-L1060] assume !(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1062] #res := 0; VAL [#NULL.base=0, #NULL.offset=0, #res=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L985-L1063] ensures #valid == old(#valid); VAL [#NULL.base=0, #NULL.offset=0, #res=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] ----- [2018-11-23 06:26:59,918 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=22, #NULL.offset=13, old(#NULL.base)=22, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L987] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L987] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L988] call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L989] call write~$Pointer$(0, 0, ~null~0.base, 4 + ~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L990] call write~int(~unnamed1~0~BLACK, ~null~0.base, 8 + ~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L992] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12); [L992] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L993] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L994] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L995] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~nondet2=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1000-L1024] assume !(0 != #t~nondet2); [L1000] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1031] call #t~mem12 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem12=1, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem12); [L1031] havoc #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1034] call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem13=1, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1034-L1039] assume !(~unnamed1~0~RED == #t~mem13); [L1034] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1041] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem16.base=20, #t~mem16.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1041] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset; [L1041] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1032-L1042] assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1045-L1060] assume !!(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1047] call #t~mem17 := read~int(~list~0.base, 8 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem17=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1047-L1059] assume !(~unnamed1~0~RED == #t~mem17); [L1047] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1056] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem20.base=20, #t~mem20.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1056] ~end~0.base, ~end~0.offset := #t~mem20.base, #t~mem20.offset; [L1056] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1057] assert 0 == ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1057] assert 0 == ~list~0.base || 1 == #valid[~list~0.base]; [L1057] call ULTIMATE.dealloc(~list~0.base, ~list~0.offset); [L1058] ~list~0.base, ~list~0.offset := ~end~0.base, ~end~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1045-L1060] assume !(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1062] #res := 0; VAL [#NULL.base=0, #NULL.offset=0, #res=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L985-L1063] ensures #valid == old(#valid); VAL [#NULL.base=0, #NULL.offset=0, #res=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=13, old(#NULL!base)=22, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~nondet2=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem12=1, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem13=1, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem16!base=20, #t~mem16!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1032-L1042] COND TRUE !(~null~0 != ~end~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1045-L1060] COND FALSE !(!(~null~0 != ~list~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1047] FCALL call #t~mem17 := read~int({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem17=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1047] COND FALSE !(~unnamed1~0~RED == #t~mem17) [L1047] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1056] FCALL call #t~mem20 := read~$Pointer$({ base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem20!base=20, #t~mem20!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1056] ~end~0 := #t~mem20; [L1056] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1057] assert 0 == ~list~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1057] assert 0 == ~list~0!base || 1 == #valid[~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(~list~0); [L1058] ~list~0 := ~end~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1045-L1060] COND TRUE !(~null~0 != ~list~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1062] #res := 0; VAL [#NULL!base=0, #NULL!offset=0, #res=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=13, old(#NULL!base)=22, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~nondet2=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem12=1, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem13=1, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem16!base=20, #t~mem16!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1032-L1042] COND TRUE !(~null~0 != ~end~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1045-L1060] COND FALSE !(!(~null~0 != ~list~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1047] FCALL call #t~mem17 := read~int({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem17=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1047] COND FALSE !(~unnamed1~0~RED == #t~mem17) [L1047] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1056] FCALL call #t~mem20 := read~$Pointer$({ base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem20!base=20, #t~mem20!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1056] ~end~0 := #t~mem20; [L1056] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1057] assert 0 == ~list~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1057] assert 0 == ~list~0!base || 1 == #valid[~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(~list~0); [L1058] ~list~0 := ~end~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1045-L1060] COND TRUE !(~null~0 != ~list~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1062] #res := 0; VAL [#NULL!base=0, #NULL!offset=0, #res=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=13, old(#NULL!base)=22, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~nondet2=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem12=1, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem13=1, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem16!base=20, #t~mem16!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1032-L1042] COND TRUE !(~null~0 != ~end~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1045-L1060] COND FALSE !(!(~null~0 != ~list~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1047] FCALL call #t~mem17 := read~int({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem17=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1047] COND FALSE !(~unnamed1~0~RED == #t~mem17) [L1047] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1056] FCALL call #t~mem20 := read~$Pointer$({ base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem20!base=20, #t~mem20!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1056] ~end~0 := #t~mem20; [L1056] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1057] assert 0 == ~list~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1057] assert 0 == ~list~0!base || 1 == #valid[~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(~list~0); [L1058] ~list~0 := ~end~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1045-L1060] COND TRUE !(~null~0 != ~list~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1062] #res := 0; VAL [#NULL!base=0, #NULL!offset=0, #res=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=13, old(#NULL!base)=22, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~nondet2=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem12=1, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem13=1, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem16!base=20, #t~mem16!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1032-L1042] COND TRUE !(~null~0 != ~end~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1045-L1060] COND FALSE !(!(~null~0 != ~list~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1047] FCALL call #t~mem17 := read~int({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem17=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1047] COND FALSE !(~unnamed1~0~RED == #t~mem17) [L1047] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1056] FCALL call #t~mem20 := read~$Pointer$({ base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem20!base=20, #t~mem20!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1056] ~end~0 := #t~mem20; [L1056] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1057] assert 0 == ~list~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1057] assert 0 == ~list~0!base || 1 == #valid[~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(~list~0); [L1058] ~list~0 := ~end~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1045-L1060] COND TRUE !(~null~0 != ~list~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1062] #res := 0; VAL [#NULL!base=0, #NULL!offset=0, #res=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [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}] ----- [2018-11-23 06:26:59,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:26:59 BoogieIcfgContainer [2018-11-23 06:26:59,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:26:59,979 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:26:59,979 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:26:59,979 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:26:59,980 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:26:53" (3/4) ... [2018-11-23 06:26:59,983 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:26:59,983 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:26:59,984 INFO L168 Benchmark]: Toolchain (without parser) took 7339.44 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -206.3 MB). Peak memory consumption was 118.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:26:59,985 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:26:59,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:26:59,985 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.08 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:26:59,986 INFO L168 Benchmark]: Boogie Preprocessor took 29.98 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-11-23 06:26:59,986 INFO L168 Benchmark]: RCFGBuilder took 475.05 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: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:26:59,986 INFO L168 Benchmark]: TraceAbstraction took 6474.42 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.2 MB). Peak memory consumption was 103.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:26:59,986 INFO L168 Benchmark]: Witness Printer took 4.01 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:26:59,992 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.08 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.98 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 475.05 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: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6474.42 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.2 MB). Peak memory consumption was 103.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.01 ms. Allocated memory is still 1.4 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, 6.4s 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.4s 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.2s SatisfiabilityAnalysisTime, 1.7s 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-aa41828 [2018-11-23 06:27:01,450 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:27:01,451 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:27:01,458 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:27:01,458 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:27:01,459 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:27:01,459 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:27:01,461 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:27:01,462 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:27:01,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:27:01,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:27:01,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:27:01,464 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:27:01,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:27:01,466 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:27:01,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:27:01,467 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:27:01,468 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:27:01,469 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:27:01,470 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:27:01,472 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:27:01,473 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:27:01,475 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:27:01,475 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:27:01,475 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:27:01,476 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:27:01,477 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:27:01,477 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:27:01,478 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:27:01,479 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:27:01,479 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:27:01,480 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:27:01,480 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:27:01,480 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:27:01,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:27:01,481 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:27:01,481 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-11-23 06:27:01,493 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:27:01,493 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:27:01,494 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:27:01,494 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:27:01,494 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 06:27:01,494 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 06:27:01,494 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 06:27:01,494 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 06:27:01,494 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 06:27:01,494 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 06:27:01,495 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:27:01,495 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:27:01,495 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:27:01,495 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:27:01,495 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:27:01,495 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:27:01,496 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:27:01,496 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:27:01,496 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 06:27:01,496 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 06:27:01,496 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 06:27:01,496 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:27:01,496 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 06:27:01,496 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 06:27:01,497 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:27:01,497 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:27:01,497 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:27:01,497 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:27:01,497 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:27:01,497 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:27:01,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:27:01,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:27:01,498 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:27:01,498 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 06:27:01,498 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:27:01,498 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 06:27:01,498 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_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/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-11-23 06:27:01,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:27:01,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:27:01,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:27:01,538 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:27:01,538 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:27:01,539 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 06:27:01,574 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/data/634d0025b/a8c1afeebb0e4229bd92d6cb8b84dfdd/FLAG11a15dbd6 [2018-11-23 06:27:01,936 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:27:01,936 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 06:27:01,945 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/data/634d0025b/a8c1afeebb0e4229bd92d6cb8b84dfdd/FLAG11a15dbd6 [2018-11-23 06:27:02,333 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/data/634d0025b/a8c1afeebb0e4229bd92d6cb8b84dfdd [2018-11-23 06:27:02,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:27:02,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:27:02,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:27:02,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:27:02,339 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:27:02,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:27:02" (1/1) ... [2018-11-23 06:27:02,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8eb79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:27:02, skipping insertion in model container [2018-11-23 06:27:02,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:27:02" (1/1) ... [2018-11-23 06:27:02,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:27:02,380 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:27:02,598 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:27:02,608 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:27:02,644 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:27:02,672 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:27:02,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:27:02 WrapperNode [2018-11-23 06:27:02,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:27:02,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:27:02,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:27:02,673 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:27:02,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:27:02" (1/1) ... [2018-11-23 06:27:02,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:27:02" (1/1) ... [2018-11-23 06:27:02,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:27:02,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:27:02,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:27:02,739 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:27:02,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:27:02" (1/1) ... [2018-11-23 06:27:02,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:27:02" (1/1) ... [2018-11-23 06:27:02,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:27:02" (1/1) ... [2018-11-23 06:27:02,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:27:02" (1/1) ... [2018-11-23 06:27:02,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:27:02" (1/1) ... [2018-11-23 06:27:02,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:27:02" (1/1) ... [2018-11-23 06:27:02,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:27:02" (1/1) ... [2018-11-23 06:27:02,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:27:02,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:27:02,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:27:02,770 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:27:02,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:27:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/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-11-23 06:27:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:27:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 06:27:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:27:02,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:27:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:27:02,805 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:27:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 06:27:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 06:27:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:27:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 06:27:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:27:02,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:27:03,361 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:27:03,361 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-11-23 06:27:03,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:27:03 BoogieIcfgContainer [2018-11-23 06:27:03,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:27:03,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:27:03,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:27:03,364 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:27:03,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:27:02" (1/3) ... [2018-11-23 06:27:03,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c05eebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:27:03, skipping insertion in model container [2018-11-23 06:27:03,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:27:02" (2/3) ... [2018-11-23 06:27:03,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c05eebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:27:03, skipping insertion in model container [2018-11-23 06:27:03,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:27:03" (3/3) ... [2018-11-23 06:27:03,366 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 06:27:03,372 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:27:03,377 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-11-23 06:27:03,387 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-11-23 06:27:03,403 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:27:03,403 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:27:03,403 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 06:27:03,403 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:27:03,403 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:27:03,404 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:27:03,404 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:27:03,404 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:27:03,404 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:27:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-11-23 06:27:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 06:27:03,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:03,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:27:03,422 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:03,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash -487060194, now seen corresponding path program 1 times [2018-11-23 06:27:03,428 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:03,428 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:03,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:03,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:03,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-11-23 06:27:03,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:03,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:03,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 06:27:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:03,524 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:03,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:03,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:27:03,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:27:03,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:27:03,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:27:03,538 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 3 states. [2018-11-23 06:27:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:03,813 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2018-11-23 06:27:03,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:27:03,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 06:27:03,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:03,823 INFO L225 Difference]: With dead ends: 169 [2018-11-23 06:27:03,823 INFO L226 Difference]: Without dead ends: 165 [2018-11-23 06:27:03,825 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-11-23 06:27:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-23 06:27:03,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 141. [2018-11-23 06:27:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 06:27:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2018-11-23 06:27:03,856 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 7 [2018-11-23 06:27:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:03,856 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2018-11-23 06:27:03,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:27:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2018-11-23 06:27:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 06:27:03,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:03,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:27:03,857 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:03,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:03,858 INFO L82 PathProgramCache]: Analyzing trace with hash -487060193, now seen corresponding path program 1 times [2018-11-23 06:27:03,858 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:03,858 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:03,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:03,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:03,900 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-11-23 06:27:03,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:03,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:03,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 06:27:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:03,914 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:03,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:03,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:27:03,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:27:03,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:27:03,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:27:03,917 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 3 states. [2018-11-23 06:27:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:04,172 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2018-11-23 06:27:04,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:27:04,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 06:27:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:04,173 INFO L225 Difference]: With dead ends: 138 [2018-11-23 06:27:04,174 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 06:27:04,174 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-11-23 06:27:04,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 06:27:04,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-23 06:27:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 06:27:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2018-11-23 06:27:04,182 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 7 [2018-11-23 06:27:04,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:04,182 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2018-11-23 06:27:04,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:27:04,182 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2018-11-23 06:27:04,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 06:27:04,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:04,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:27:04,183 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:04,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:04,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1606843618, now seen corresponding path program 1 times [2018-11-23 06:27:04,184 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:04,184 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:04,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:04,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:04,272 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-11-23 06:27:04,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:04,281 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-11-23 06:27:04,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-23 06:27:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:04,292 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:04,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:04,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:27:04,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:27:04,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:27:04,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:27:04,294 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 4 states. [2018-11-23 06:27:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:04,511 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-11-23 06:27:04,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:27:04,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 06:27:04,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:04,512 INFO L225 Difference]: With dead ends: 137 [2018-11-23 06:27:04,512 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 06:27:04,512 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-11-23 06:27:04,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 06:27:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-11-23 06:27:04,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 06:27:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2018-11-23 06:27:04,517 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 11 [2018-11-23 06:27:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:04,518 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2018-11-23 06:27:04,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:27:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2018-11-23 06:27:04,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 06:27:04,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:04,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:27:04,520 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:04,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1606843619, now seen corresponding path program 1 times [2018-11-23 06:27:04,521 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:04,521 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:04,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:04,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:04,567 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-11-23 06:27:04,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:04,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:04,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 06:27:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:04,577 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:04,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:04,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:27:04,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:27:04,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:27:04,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:27:04,580 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 3 states. [2018-11-23 06:27:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:04,811 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-11-23 06:27:04,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:27:04,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 06:27:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:04,813 INFO L225 Difference]: With dead ends: 146 [2018-11-23 06:27:04,813 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 06:27:04,813 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-11-23 06:27:04,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 06:27:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2018-11-23 06:27:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-23 06:27:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-11-23 06:27:04,819 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 11 [2018-11-23 06:27:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:04,819 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-11-23 06:27:04,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:27:04,820 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-11-23 06:27:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 06:27:04,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:04,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:27:04,821 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:04,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:04,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1511028585, now seen corresponding path program 1 times [2018-11-23 06:27:04,821 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:04,821 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:04,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:04,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:04,896 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-11-23 06:27:04,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:04,901 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-11-23 06:27:04,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-23 06:27:04,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:04,911 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:04,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:04,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:27:04,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:27:04,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:27:04,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:27:04,913 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 4 states. [2018-11-23 06:27:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:05,204 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 06:27:05,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:27:05,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 06:27:05,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:05,205 INFO L225 Difference]: With dead ends: 138 [2018-11-23 06:27:05,205 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 06:27:05,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-11-23 06:27:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 06:27:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2018-11-23 06:27:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 06:27:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-11-23 06:27:05,210 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 16 [2018-11-23 06:27:05,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:05,210 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-11-23 06:27:05,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:27:05,211 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-11-23 06:27:05,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 06:27:05,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:05,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:27:05,212 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:05,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1511028584, now seen corresponding path program 1 times [2018-11-23 06:27:05,212 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:05,212 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:05,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:05,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:05,287 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-11-23 06:27:05,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:05,300 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-11-23 06:27:05,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:05,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:05,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-23 06:27:05,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:05,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:05,329 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-11-23 06:27:05,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:05,340 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-11-23 06:27:05,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:05,347 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-11-23 06:27:05,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-11-23 06:27:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:05,361 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:05,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:05,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:27:05,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:27:05,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:27:05,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:27:05,364 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 5 states. [2018-11-23 06:27:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:05,980 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2018-11-23 06:27:05,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:27:05,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 06:27:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:05,981 INFO L225 Difference]: With dead ends: 153 [2018-11-23 06:27:05,981 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 06:27:05,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:27:05,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 06:27:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2018-11-23 06:27:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 06:27:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2018-11-23 06:27:05,985 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 16 [2018-11-23 06:27:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:05,985 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2018-11-23 06:27:05,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:27:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2018-11-23 06:27:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 06:27:05,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:05,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:27:05,987 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:05,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:05,988 INFO L82 PathProgramCache]: Analyzing trace with hash -399523878, now seen corresponding path program 1 times [2018-11-23 06:27:05,988 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:05,988 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:06,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:06,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:06,052 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-11-23 06:27:06,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 06:27:06,080 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-11-23 06:27:06,082 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-11-23 06:27:06,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-23 06:27:06,099 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-11-23 06:27:06,101 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-11-23 06:27:06,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-11-23 06:27:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:06,110 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:06,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:06,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:27:06,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:27:06,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:27:06,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:27:06,112 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 5 states. [2018-11-23 06:27:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:06,555 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2018-11-23 06:27:06,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:27:06,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 06:27:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:06,556 INFO L225 Difference]: With dead ends: 174 [2018-11-23 06:27:06,556 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 06:27:06,556 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-11-23 06:27:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 06:27:06,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2018-11-23 06:27:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 06:27:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-11-23 06:27:06,559 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 18 [2018-11-23 06:27:06,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:06,560 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-11-23 06:27:06,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:27:06,560 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-11-23 06:27:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 06:27:06,560 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:06,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:27:06,561 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:06,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:06,561 INFO L82 PathProgramCache]: Analyzing trace with hash -399523877, now seen corresponding path program 1 times [2018-11-23 06:27:06,561 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:06,561 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:06,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:06,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:06,640 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-11-23 06:27:06,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 06:27:06,666 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-11-23 06:27:06,668 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-11-23 06:27:06,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,682 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-11-23 06:27:06,684 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-11-23 06:27:06,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,692 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-11-23 06:27:06,708 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-11-23 06:27:06,711 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-11-23 06:27:06,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,720 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-11-23 06:27:06,722 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-11-23 06:27:06,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:06,727 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-11-23 06:27:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:06,735 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:06,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:06,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:27:06,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:27:06,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:27:06,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:27:06,737 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 5 states. [2018-11-23 06:27:07,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:07,265 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2018-11-23 06:27:07,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:27:07,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 06:27:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:07,266 INFO L225 Difference]: With dead ends: 195 [2018-11-23 06:27:07,266 INFO L226 Difference]: Without dead ends: 195 [2018-11-23 06:27:07,266 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-11-23 06:27:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-23 06:27:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 130. [2018-11-23 06:27:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 06:27:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-11-23 06:27:07,268 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2018-11-23 06:27:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:07,268 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-11-23 06:27:07,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:27:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-11-23 06:27:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 06:27:07,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:07,269 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-11-23 06:27:07,269 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:07,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:07,269 INFO L82 PathProgramCache]: Analyzing trace with hash -935404900, now seen corresponding path program 1 times [2018-11-23 06:27:07,269 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:07,269 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:07,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:07,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:07,375 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-11-23 06:27:07,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:07,379 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-11-23 06:27:07,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-23 06:27:07,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:07,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:07,400 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-11-23 06:27:07,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:07,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:07,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-11-23 06:27:07,425 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-11-23 06:27:07,428 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-11-23 06:27:07,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:07,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:07,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:07,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-11-23 06:27:07,478 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-11-23 06:27:07,481 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-11-23 06:27:07,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:07,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:07,502 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-11-23 06:27:07,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-23 06:27:07,538 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-11-23 06:27:07,542 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-11-23 06:27:07,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:07,553 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-11-23 06:27:07,554 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:07,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:07,563 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-11-23 06:27:07,563 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-23 06:27:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:07,596 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:07,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:07,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 06:27:07,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 06:27:07,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 06:27:07,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-11-23 06:27:07,599 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 11 states. [2018-11-23 06:27:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:08,705 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2018-11-23 06:27:08,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 06:27:08,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-11-23 06:27:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:08,706 INFO L225 Difference]: With dead ends: 176 [2018-11-23 06:27:08,706 INFO L226 Difference]: Without dead ends: 176 [2018-11-23 06:27:08,706 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-11-23 06:27:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-23 06:27:08,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 129. [2018-11-23 06:27:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 06:27:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-11-23 06:27:08,709 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 22 [2018-11-23 06:27:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:08,709 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-11-23 06:27:08,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 06:27:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-11-23 06:27:08,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 06:27:08,710 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:08,710 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-11-23 06:27:08,710 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:08,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:08,710 INFO L82 PathProgramCache]: Analyzing trace with hash -935404899, now seen corresponding path program 1 times [2018-11-23 06:27:08,710 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:08,710 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:08,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:08,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:08,815 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-11-23 06:27:08,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:08,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:08,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 06:27:08,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:08,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:08,832 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-11-23 06:27:08,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:08,840 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-11-23 06:27:08,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:08,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:08,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-11-23 06:27:08,867 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-11-23 06:27:08,870 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-11-23 06:27:08,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:08,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:08,886 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-11-23 06:27:08,888 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-11-23 06:27:08,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:08,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:08,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:08,898 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-11-23 06:27:08,945 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-11-23 06:27:08,949 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-11-23 06:27:08,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:08,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:08,984 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-11-23 06:27:08,987 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-11-23 06:27:08,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:08,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:09,012 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-11-23 06:27:09,012 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-11-23 06:27:09,058 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-11-23 06:27:09,061 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-11-23 06:27:09,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:09,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-23 06:27:09,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:09,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:09,091 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-11-23 06:27:09,094 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-11-23 06:27:09,094 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:09,102 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-11-23 06:27:09,102 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:09,107 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:09,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:09,113 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-11-23 06:27:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:09,139 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:09,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:09,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 06:27:09,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 06:27:09,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 06:27:09,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 06:27:09,141 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 10 states. [2018-11-23 06:27:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:10,625 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-11-23 06:27:10,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 06:27:10,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-23 06:27:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:10,627 INFO L225 Difference]: With dead ends: 152 [2018-11-23 06:27:10,627 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 06:27:10,627 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-11-23 06:27:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 06:27:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 131. [2018-11-23 06:27:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 06:27:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-11-23 06:27:10,630 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 22 [2018-11-23 06:27:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:10,630 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-11-23 06:27:10,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 06:27:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-11-23 06:27:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 06:27:10,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:10,631 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-11-23 06:27:10,631 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:10,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:10,632 INFO L82 PathProgramCache]: Analyzing trace with hash 75907902, now seen corresponding path program 1 times [2018-11-23 06:27:10,632 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:10,632 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:10,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:10,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:10,694 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:10,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:10,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:27:10,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:27:10,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:27:10,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:27:10,697 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand 3 states. [2018-11-23 06:27:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:10,856 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-11-23 06:27:10,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:27:10,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 06:27:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:10,857 INFO L225 Difference]: With dead ends: 139 [2018-11-23 06:27:10,857 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 06:27:10,857 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-11-23 06:27:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 06:27:10,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2018-11-23 06:27:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 06:27:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-11-23 06:27:10,859 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 25 [2018-11-23 06:27:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:10,859 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-11-23 06:27:10,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:27:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-11-23 06:27:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 06:27:10,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:10,860 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-11-23 06:27:10,860 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:10,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:10,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2039865847, now seen corresponding path program 1 times [2018-11-23 06:27:10,860 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:10,860 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:10,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:10,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:10,983 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-11-23 06:27:10,985 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-11-23 06:27:10,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:10,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,005 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-11-23 06:27:11,006 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-11-23 06:27:11,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,015 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-11-23 06:27:11,037 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-11-23 06:27:11,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,044 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-11-23 06:27:11,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,081 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-11-23 06:27:11,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,085 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-11-23 06:27:11,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,104 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-23 06:27:11,141 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-11-23 06:27:11,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,161 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-11-23 06:27:11,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,213 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-11-23 06:27:11,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,228 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-11-23 06:27:11,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,248 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2018-11-23 06:27:11,272 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-11-23 06:27:11,274 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-11-23 06:27:11,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,290 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-11-23 06:27:11,292 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-11-23 06:27:11,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:10 [2018-11-23 06:27:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:11,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:27:11,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,475 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:27:11,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:27:11,512 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,522 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,539 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:27:11,541 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:27:11,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 06:27:11,546 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:97, output treesize:25 [2018-11-23 06:27:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:11,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:27:11,593 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/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-11-23 06:27:11,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:11,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:11,632 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-11-23 06:27:11,634 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-11-23 06:27:11,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,653 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-11-23 06:27:11,655 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-11-23 06:27:11,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,664 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2018-11-23 06:27:11,674 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-11-23 06:27:11,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,679 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-11-23 06:27:11,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,715 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-11-23 06:27:11,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,719 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-11-23 06:27:11,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:39 [2018-11-23 06:27:11,747 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-11-23 06:27:11,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,764 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-11-23 06:27:11,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,812 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-11-23 06:27:11,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:11,823 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-11-23 06:27:11,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,834 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2018-11-23 06:27:11,853 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-11-23 06:27:11,856 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-11-23 06:27:11,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,878 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-11-23 06:27:11,880 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-11-23 06:27:11,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,889 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:10 [2018-11-23 06:27:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:11,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:27:11,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:11,990 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:27:12,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:27:12,031 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:27:12,033 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:27:12,053 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:12,056 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:12,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 06:27:12,064 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:97, output treesize:25 [2018-11-23 06:27:12,107 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 06:27:12,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:12,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:12,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:1 [2018-11-23 06:27:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:12,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 06:27:12,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 9, 7] total 14 [2018-11-23 06:27:12,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 06:27:12,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 06:27:12,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-11-23 06:27:12,129 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 14 states. [2018-11-23 06:27:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:13,233 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2018-11-23 06:27:13,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 06:27:13,234 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 06:27:13,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:13,235 INFO L225 Difference]: With dead ends: 186 [2018-11-23 06:27:13,235 INFO L226 Difference]: Without dead ends: 186 [2018-11-23 06:27:13,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-11-23 06:27:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-23 06:27:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 144. [2018-11-23 06:27:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 06:27:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-11-23 06:27:13,238 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 28 [2018-11-23 06:27:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:13,239 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-11-23 06:27:13,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 06:27:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-11-23 06:27:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 06:27:13,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:13,239 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-11-23 06:27:13,240 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:13,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:13,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1615706815, now seen corresponding path program 1 times [2018-11-23 06:27:13,240 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:13,240 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:13,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:13,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:13,335 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-11-23 06:27:13,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:13,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:13,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 06:27:13,343 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-11-23 06:27:13,345 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-11-23 06:27:13,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:13,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:13,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:13,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-23 06:27:13,362 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-11-23 06:27:13,364 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-11-23 06:27:13,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:13,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:13,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:13,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 06:27:13,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:13,371 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:13,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:13,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:27:13,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:27:13,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:27:13,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:27:13,374 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 5 states. [2018-11-23 06:27:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:13,931 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2018-11-23 06:27:13,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:27:13,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 06:27:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:13,933 INFO L225 Difference]: With dead ends: 206 [2018-11-23 06:27:13,933 INFO L226 Difference]: Without dead ends: 206 [2018-11-23 06:27:13,933 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-11-23 06:27:13,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-23 06:27:13,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 143. [2018-11-23 06:27:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 06:27:13,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-11-23 06:27:13,936 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 28 [2018-11-23 06:27:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:13,936 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-11-23 06:27:13,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:27:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-11-23 06:27:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 06:27:13,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:13,937 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-11-23 06:27:13,937 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:13,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:13,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1615706814, now seen corresponding path program 1 times [2018-11-23 06:27:13,938 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:13,938 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:13,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:14,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:14,031 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-11-23 06:27:14,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 06:27:14,046 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-11-23 06:27:14,048 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-11-23 06:27:14,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,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 11 treesize of output 8 [2018-11-23 06:27:14,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-11-23 06:27:14,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,066 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,072 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-11-23 06:27:14,082 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-11-23 06:27:14,083 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-11-23 06:27:14,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,092 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-11-23 06:27:14,093 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-11-23 06:27:14,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,098 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-11-23 06:27:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:14,105 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:14,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:14,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:27:14,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:27:14,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:27:14,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:27:14,107 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 5 states. [2018-11-23 06:27:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:14,679 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-11-23 06:27:14,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:27:14,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 06:27:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:14,680 INFO L225 Difference]: With dead ends: 227 [2018-11-23 06:27:14,680 INFO L226 Difference]: Without dead ends: 227 [2018-11-23 06:27:14,681 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-11-23 06:27:14,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-23 06:27:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 142. [2018-11-23 06:27:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-23 06:27:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-11-23 06:27:14,684 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 28 [2018-11-23 06:27:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:14,684 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-11-23 06:27:14,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:27:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-11-23 06:27:14,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 06:27:14,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:14,685 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-11-23 06:27:14,685 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:14,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:14,685 INFO L82 PathProgramCache]: Analyzing trace with hash 4434480, now seen corresponding path program 1 times [2018-11-23 06:27:14,686 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:14,686 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:14,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:14,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:14,736 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-11-23 06:27:14,737 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-11-23 06:27:14,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:14,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-23 06:27:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:14,746 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:14,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:14,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:27:14,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:27:14,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:27:14,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:27:14,748 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 5 states. [2018-11-23 06:27:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:15,116 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-11-23 06:27:15,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:27:15,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 06:27:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:15,117 INFO L225 Difference]: With dead ends: 145 [2018-11-23 06:27:15,117 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 06:27:15,117 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-11-23 06:27:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 06:27:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-11-23 06:27:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 06:27:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2018-11-23 06:27:15,121 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 29 [2018-11-23 06:27:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:15,121 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2018-11-23 06:27:15,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:27:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2018-11-23 06:27:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 06:27:15,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:15,122 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-11-23 06:27:15,122 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:15,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:15,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1805986873, now seen corresponding path program 1 times [2018-11-23 06:27:15,123 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:15,123 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:15,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:15,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:15,188 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-11-23 06:27:15,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 06:27:15,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:15,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:15,196 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-11-23 06:27:15,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-23 06:27:15,205 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-11-23 06:27:15,206 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-11-23 06:27:15,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:4 [2018-11-23 06:27:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:27:15,210 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:15,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:15,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:27:15,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:27:15,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:27:15,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:27:15,212 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 4 states. [2018-11-23 06:27:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:15,408 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-11-23 06:27:15,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:27:15,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 06:27:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:15,410 INFO L225 Difference]: With dead ends: 170 [2018-11-23 06:27:15,410 INFO L226 Difference]: Without dead ends: 170 [2018-11-23 06:27:15,410 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-11-23 06:27:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-23 06:27:15,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 141. [2018-11-23 06:27:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 06:27:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-11-23 06:27:15,413 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 30 [2018-11-23 06:27:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:15,413 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-11-23 06:27:15,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:27:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-11-23 06:27:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 06:27:15,414 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:15,414 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-11-23 06:27:15,414 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:15,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:15,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1185936324, now seen corresponding path program 1 times [2018-11-23 06:27:15,415 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:15,415 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:15,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:15,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:15,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 6 treesize of output 5 [2018-11-23 06:27:15,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 06:27:15,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:15,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:15,604 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-11-23 06:27:15,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-11-23 06:27:15,621 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-11-23 06:27:15,623 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-11-23 06:27:15,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-11-23 06:27:15,670 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-11-23 06:27:15,672 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-11-23 06:27:15,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,692 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-11-23 06:27:15,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-23 06:27:15,723 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-11-23 06:27:15,726 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-11-23 06:27:15,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,735 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-11-23 06:27:15,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,743 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-11-23 06:27:15,744 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-23 06:27:15,783 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-11-23 06:27:15,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:15,796 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:27:15,796 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-11-23 06:27:15,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:13 [2018-11-23 06:27:15,827 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-11-23 06:27:15,829 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-11-23 06:27:15,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,844 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-11-23 06:27:15,846 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-11-23 06:27:15,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,849 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-11-23 06:27:15,917 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-11-23 06:27:15,920 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-11-23 06:27:15,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,980 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-11-23 06:27:15,983 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-11-23 06:27:15,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:15,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:16,012 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-11-23 06:27:16,013 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-11-23 06:27:16,070 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-11-23 06:27:16,073 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-11-23 06:27:16,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:16,084 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-11-23 06:27:16,084 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:16,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:16,113 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-11-23 06:27:16,115 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-11-23 06:27:16,115 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:16,124 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-11-23 06:27:16,124 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:16,130 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:16,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:16,136 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-11-23 06:27:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:16,185 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:16,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:16,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 06:27:16,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 06:27:16,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 06:27:16,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-23 06:27:16,187 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 16 states. [2018-11-23 06:27:17,313 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-11-23 06:27:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:18,381 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-11-23 06:27:18,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 06:27:18,382 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-11-23 06:27:18,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:18,382 INFO L225 Difference]: With dead ends: 146 [2018-11-23 06:27:18,382 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 06:27:18,383 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-11-23 06:27:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 06:27:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 120. [2018-11-23 06:27:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 06:27:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2018-11-23 06:27:18,386 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 32 [2018-11-23 06:27:18,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:18,386 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2018-11-23 06:27:18,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 06:27:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-11-23 06:27:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 06:27:18,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:18,387 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-11-23 06:27:18,387 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:18,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:18,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1185936323, now seen corresponding path program 1 times [2018-11-23 06:27:18,387 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:18,387 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:18,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:18,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:18,539 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-11-23 06:27:18,540 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-11-23 06:27:18,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:18,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:18,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:18,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:7, output treesize:1 [2018-11-23 06:27:18,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:18,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:27:18,547 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-11-23 06:27:18,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:18,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:18,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-11-23 06:27:18,582 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-11-23 06:27:18,585 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-11-23 06:27:18,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:18,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:18,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:18,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2018-11-23 06:27:18,626 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 39 treesize of output 35 [2018-11-23 06:27:18,629 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-11-23 06:27:18,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:18,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:18,649 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-11-23 06:27:18,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-11-23 06:27:18,675 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-11-23 06:27:18,677 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-11-23 06:27:18,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:18,684 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-11-23 06:27:18,684 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:18,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:18,692 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-11-23 06:27:18,693 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:16 [2018-11-23 06:27:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:18,717 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:18,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:18,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 06:27:18,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 06:27:18,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 06:27:18,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:27:18,720 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 9 states. [2018-11-23 06:27:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:19,684 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-11-23 06:27:19,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 06:27:19,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 06:27:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:19,685 INFO L225 Difference]: With dead ends: 135 [2018-11-23 06:27:19,685 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 06:27:19,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-11-23 06:27:19,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 06:27:19,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2018-11-23 06:27:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 06:27:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-11-23 06:27:19,687 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 32 [2018-11-23 06:27:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:19,687 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-11-23 06:27:19,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 06:27:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-11-23 06:27:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 06:27:19,687 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:19,687 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-11-23 06:27:19,687 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:19,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:19,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1420731406, now seen corresponding path program 1 times [2018-11-23 06:27:19,688 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:19,688 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:19,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:19,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:19,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, 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-11-23 06:27:19,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, 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-11-23 06:27:19,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:19,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:19,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:19,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-23 06:27:19,770 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-11-23 06:27:19,772 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-11-23 06:27:19,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:19,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:19,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:19,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-23 06:27:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:27:19,779 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:27:19,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:27:19,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:27:19,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:27:19,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:27:19,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:27:19,782 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 4 states. [2018-11-23 06:27:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:19,959 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-11-23 06:27:19,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:27:19,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-23 06:27:19,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:19,961 INFO L225 Difference]: With dead ends: 127 [2018-11-23 06:27:19,961 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 06:27:19,961 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-11-23 06:27:19,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 06:27:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-11-23 06:27:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 06:27:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-11-23 06:27:19,964 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 35 [2018-11-23 06:27:19,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:19,964 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-11-23 06:27:19,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:27:19,964 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-11-23 06:27:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 06:27:19,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:19,965 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-11-23 06:27:19,965 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:19,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:19,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1765302171, now seen corresponding path program 1 times [2018-11-23 06:27:19,965 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:19,966 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:19,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:20,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:20,071 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-11-23 06:27:20,073 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-11-23 06:27:20,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,083 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-11-23 06:27:20,084 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-11-23 06:27:20,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:3 [2018-11-23 06:27:20,131 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-11-23 06:27:20,133 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-11-23 06:27:20,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,156 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-11-23 06:27:20,158 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-11-23 06:27:20,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,164 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,169 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 06:27:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:20,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:27:20,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:20,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:27:20,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/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-11-23 06:27:20,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:27:20,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:27:20,353 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-11-23 06:27:20,355 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-11-23 06:27:20,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,362 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-11-23 06:27:20,364 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-11-23 06:27:20,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,365 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:1 [2018-11-23 06:27:20,385 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-11-23 06:27:20,387 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-11-23 06:27:20,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,397 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-11-23 06:27:20,399 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-11-23 06:27:20,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:27:20,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-23 06:27:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:20,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:27:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:27:20,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 06:27:20,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9, 9] total 15 [2018-11-23 06:27:20,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 06:27:20,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 06:27:20,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-23 06:27:20,427 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 15 states. [2018-11-23 06:27:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:27:21,882 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2018-11-23 06:27:21,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 06:27:21,883 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-11-23 06:27:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:27:21,883 INFO L225 Difference]: With dead ends: 170 [2018-11-23 06:27:21,883 INFO L226 Difference]: Without dead ends: 170 [2018-11-23 06:27:21,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2018-11-23 06:27:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-23 06:27:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 132. [2018-11-23 06:27:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 06:27:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2018-11-23 06:27:21,886 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 36 [2018-11-23 06:27:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:27:21,886 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2018-11-23 06:27:21,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 06:27:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2018-11-23 06:27:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 06:27:21,887 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:27:21,887 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-11-23 06:27:21,887 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION]=== [2018-11-23 06:27:21,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:27:21,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1110206992, now seen corresponding path program 1 times [2018-11-23 06:27:21,888 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 06:27:21,888 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52219b5-d4ad-4d8f-a4af-8f44ec3763f2/bin-2019/utaipan/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 06:27:21,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:27:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:27:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:27:22,112 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] RET #284#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret21 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32); srcloc: L988 VAL [main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32); srcloc: L988-1 VAL [main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(8bv32, ~null~0.offset), 4bv32); srcloc: L989 VAL [main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L993 VAL [main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L993-1 VAL [main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); srcloc: L994 VAL [main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !(0bv32 != #t~nondet2);havoc #t~nondet2; VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] goto; VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call #t~mem12 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); srcloc: L1031-3 VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~mem12|=(_ bv1 32)] [?] assume !!(~unnamed1~0~BLACK == #t~mem12);havoc #t~mem12; VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] goto; VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call #t~mem13 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); srcloc: L1034 VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~mem13|=(_ bv1 32)] [?] assume !(~unnamed1~0~RED == #t~mem13);havoc #t~mem13; VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1034-2 VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~mem16.base|=(_ bv1 32), |main_#t~mem16.offset|=(_ bv0 32)] [?] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset; VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !!(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call #t~mem17 := read~intINTTYPE4(~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); srcloc: L1047 VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~mem17|=(_ bv1 32)] [?] assume !(~unnamed1~0~RED == #t~mem17);havoc #t~mem17; VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~list~0.base, ~list~0.offset, 4bv32); srcloc: L1056 VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~mem20.base|=(_ bv1 32), |main_#t~mem20.offset|=(_ bv0 32)] [?] ~end~0.base, ~end~0.offset := #t~mem20.base, #t~mem20.offset;havoc #t~mem20.base, #t~mem20.offset; VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume 0bv32 == ~list~0.offset; VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume 0bv32 == ~list~0.base || 1bv1 == #valid[~list~0.base];call ULTIMATE.dealloc(~list~0.base, ~list~0.offset);~list~0.base, ~list~0.offset := ~end~0.base, ~end~0.offset; VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv1 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv1 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] #res := 0bv32; VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv1 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#res|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !(#valid == old(#valid)); VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv1 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#res|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret21 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L987] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32); [L987] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L988] call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L989] call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L990] call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(8bv32, ~null~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L992] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12bv32); [L992] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L993] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L994] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L995] call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1000-L1024] assume !(0bv32 != #t~nondet2); [L1000] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1031] call #t~mem12 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem12=1bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem12); [L1031] havoc #t~mem12; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1034] call #t~mem13 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem13=1bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1034-L1039] assume !(~unnamed1~0~RED == #t~mem13); [L1034] havoc #t~mem13; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1041] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem16.base=1bv32, #t~mem16.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1041] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset; [L1041] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1032-L1042] assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1045-L1060] assume !!(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1047] call #t~mem17 := read~intINTTYPE4(~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem17=1bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1047-L1059] assume !(~unnamed1~0~RED == #t~mem17); [L1047] havoc #t~mem17; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1056] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~list~0.base, ~list~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem20.base=1bv32, #t~mem20.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1056] ~end~0.base, ~end~0.offset := #t~mem20.base, #t~mem20.offset; [L1056] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1057] assert 0bv32 == ~list~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1057] assert 0bv32 == ~list~0.base || 1bv1 == #valid[~list~0.base]; [L1057] call ULTIMATE.dealloc(~list~0.base, ~list~0.offset); [L1058] ~list~0.base, ~list~0.offset := ~end~0.base, ~end~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1045-L1060] assume !(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1062] #res := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L985-L1063] ensures #valid == old(#valid); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] ----- [2018-11-23 06:27:22,137 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret21 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L987] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32); [L987] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L988] call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L989] call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L990] call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(8bv32, ~null~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L992] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12bv32); [L992] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L993] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L994] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L995] call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1000-L1024] assume !(0bv32 != #t~nondet2); [L1000] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1031] call #t~mem12 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem12=1bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem12); [L1031] havoc #t~mem12; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1034] call #t~mem13 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem13=1bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1034-L1039] assume !(~unnamed1~0~RED == #t~mem13); [L1034] havoc #t~mem13; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1041] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem16.base=1bv32, #t~mem16.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1041] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset; [L1041] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1032-L1042] assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1045-L1060] assume !!(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1047] call #t~mem17 := read~intINTTYPE4(~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem17=1bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1047-L1059] assume !(~unnamed1~0~RED == #t~mem17); [L1047] havoc #t~mem17; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1056] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~list~0.base, ~list~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem20.base=1bv32, #t~mem20.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1056] ~end~0.base, ~end~0.offset := #t~mem20.base, #t~mem20.offset; [L1056] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1057] assert 0bv32 == ~list~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1057] assert 0bv32 == ~list~0.base || 1bv1 == #valid[~list~0.base]; [L1057] call ULTIMATE.dealloc(~list~0.base, ~list~0.offset); [L1058] ~list~0.base, ~list~0.offset := ~end~0.base, ~end~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1045-L1060] assume !(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1062] #res := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L985-L1063] ensures #valid == old(#valid); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12bv32); [L987] ~null~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L988] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~null~0!base, offset: ~null~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L989] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~null~0!base, offset: ~bvadd32(4bv32, ~null~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L990] FCALL call write~intINTTYPE4(~unnamed1~0~BLACK, { base: ~null~0!base, offset: ~bvadd32(8bv32, ~null~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12bv32); [L992] ~list~0 := #t~malloc1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~bvadd32(4bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L995] FCALL call write~intINTTYPE4(~unnamed1~0~BLACK, { base: ~list~0!base, offset: ~bvadd32(8bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1000-L1024] COND TRUE !(0bv32 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1031] FCALL call #t~mem12 := read~intINTTYPE4({ base: ~end~0!base, offset: ~bvadd32(8bv32, ~end~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem12=1bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1034] FCALL call #t~mem13 := read~intINTTYPE4({ base: ~end~0!base, offset: ~bvadd32(8bv32, ~end~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem13=1bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem16!base=1bv32, #t~mem16!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1032-L1042] COND TRUE !(~null~0 != ~end~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1045-L1060] COND FALSE !(!(~null~0 != ~list~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1047] FCALL call #t~mem17 := read~intINTTYPE4({ base: ~list~0!base, offset: ~bvadd32(8bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem17=1bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1047] COND FALSE !(~unnamed1~0~RED == #t~mem17) [L1047] havoc #t~mem17; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1056] FCALL call #t~mem20 := read~$Pointer$({ base: ~list~0!base, offset: ~list~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem20!base=1bv32, #t~mem20!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1056] ~end~0 := #t~mem20; [L1056] havoc #t~mem20; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1057] assert 0bv32 == ~list~0!offset; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1057] assert 0bv32 == ~list~0!base || 1bv1 == #valid[~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(~list~0); [L1058] ~list~0 := ~end~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1045-L1060] COND TRUE !(~null~0 != ~list~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1062] #res := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12bv32); [L987] ~null~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L988] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~null~0!base, offset: ~null~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L989] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~null~0!base, offset: ~bvadd32(4bv32, ~null~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L990] FCALL call write~intINTTYPE4(~unnamed1~0~BLACK, { base: ~null~0!base, offset: ~bvadd32(8bv32, ~null~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12bv32); [L992] ~list~0 := #t~malloc1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~bvadd32(4bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L995] FCALL call write~intINTTYPE4(~unnamed1~0~BLACK, { base: ~list~0!base, offset: ~bvadd32(8bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1000-L1024] COND TRUE !(0bv32 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1031] FCALL call #t~mem12 := read~intINTTYPE4({ base: ~end~0!base, offset: ~bvadd32(8bv32, ~end~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem12=1bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1034] FCALL call #t~mem13 := read~intINTTYPE4({ base: ~end~0!base, offset: ~bvadd32(8bv32, ~end~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem13=1bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem16!base=1bv32, #t~mem16!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1032-L1042] COND TRUE !(~null~0 != ~end~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1045-L1060] COND FALSE !(!(~null~0 != ~list~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1047] FCALL call #t~mem17 := read~intINTTYPE4({ base: ~list~0!base, offset: ~bvadd32(8bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem17=1bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1047] COND FALSE !(~unnamed1~0~RED == #t~mem17) [L1047] havoc #t~mem17; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1056] FCALL call #t~mem20 := read~$Pointer$({ base: ~list~0!base, offset: ~list~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem20!base=1bv32, #t~mem20!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1056] ~end~0 := #t~mem20; [L1056] havoc #t~mem20; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1057] assert 0bv32 == ~list~0!offset; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1057] assert 0bv32 == ~list~0!base || 1bv1 == #valid[~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(~list~0); [L1058] ~list~0 := ~end~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1045-L1060] COND TRUE !(~null~0 != ~list~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1062] #res := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12bv32); [L987] ~null~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L988] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~null~0!base, offset: ~null~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L989] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~null~0!base, offset: ~bvadd32(4bv32, ~null~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L990] FCALL call write~intINTTYPE4(~unnamed1~0~BLACK, { base: ~null~0!base, offset: ~bvadd32(8bv32, ~null~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12bv32); [L992] ~list~0 := #t~malloc1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~bvadd32(4bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L995] FCALL call write~intINTTYPE4(~unnamed1~0~BLACK, { base: ~list~0!base, offset: ~bvadd32(8bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1000-L1024] COND TRUE !(0bv32 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1031] FCALL call #t~mem12 := read~intINTTYPE4({ base: ~end~0!base, offset: ~bvadd32(8bv32, ~end~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem12=1bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1034] FCALL call #t~mem13 := read~intINTTYPE4({ base: ~end~0!base, offset: ~bvadd32(8bv32, ~end~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem13=1bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem16!base=1bv32, #t~mem16!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1032-L1042] COND TRUE !(~null~0 != ~end~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1045-L1060] COND FALSE !(!(~null~0 != ~list~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1047] FCALL call #t~mem17 := read~intINTTYPE4({ base: ~list~0!base, offset: ~bvadd32(8bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem17=1bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1047] COND FALSE !(~unnamed1~0~RED == #t~mem17) [L1047] havoc #t~mem17; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1056] FCALL call #t~mem20 := read~$Pointer$({ base: ~list~0!base, offset: ~list~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem20!base=1bv32, #t~mem20!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1056] ~end~0 := #t~mem20; [L1056] havoc #t~mem20; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1057] assert 0bv32 == ~list~0!offset; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1057] assert 0bv32 == ~list~0!base || 1bv1 == #valid[~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(~list~0); [L1058] ~list~0 := ~end~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1045-L1060] COND TRUE !(~null~0 != ~list~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1062] #res := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12bv32); [L987] ~null~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L988] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~null~0!base, offset: ~null~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L989] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~null~0!base, offset: ~bvadd32(4bv32, ~null~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L990] FCALL call write~intINTTYPE4(~unnamed1~0~BLACK, { base: ~null~0!base, offset: ~bvadd32(8bv32, ~null~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12bv32); [L992] ~list~0 := #t~malloc1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~bvadd32(4bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L995] FCALL call write~intINTTYPE4(~unnamed1~0~BLACK, { base: ~list~0!base, offset: ~bvadd32(8bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1000-L1024] COND TRUE !(0bv32 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1031] FCALL call #t~mem12 := read~intINTTYPE4({ base: ~end~0!base, offset: ~bvadd32(8bv32, ~end~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem12=1bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1034] FCALL call #t~mem13 := read~intINTTYPE4({ base: ~end~0!base, offset: ~bvadd32(8bv32, ~end~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem13=1bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem16!base=1bv32, #t~mem16!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1032-L1042] COND TRUE !(~null~0 != ~end~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1045-L1060] COND FALSE !(!(~null~0 != ~list~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1047] FCALL call #t~mem17 := read~intINTTYPE4({ base: ~list~0!base, offset: ~bvadd32(8bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem17=1bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1047] COND FALSE !(~unnamed1~0~RED == #t~mem17) [L1047] havoc #t~mem17; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1056] FCALL call #t~mem20 := read~$Pointer$({ base: ~list~0!base, offset: ~list~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem20!base=1bv32, #t~mem20!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1056] ~end~0 := #t~mem20; [L1056] havoc #t~mem20; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1057] assert 0bv32 == ~list~0!offset; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1057] assert 0bv32 == ~list~0!base || 1bv1 == #valid[~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(~list~0); [L1058] ~list~0 := ~end~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1045-L1060] COND TRUE !(~null~0 != ~list~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1062] #res := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [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}] ----- [2018-11-23 06:27:22,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:27:22 BoogieIcfgContainer [2018-11-23 06:27:22,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:27:22,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:27:22,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:27:22,225 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:27:22,226 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:27:03" (3/4) ... [2018-11-23 06:27:22,229 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:27:22,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:27:22,230 INFO L168 Benchmark]: Toolchain (without parser) took 19894.45 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 122.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:27:22,230 INFO L168 Benchmark]: CDTParser took 0.13 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-11-23 06:27:22,230 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.29 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 922.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:27:22,230 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 922.9 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:27:22,231 INFO L168 Benchmark]: Boogie Preprocessor took 30.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:27:22,231 INFO L168 Benchmark]: RCFGBuilder took 591.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:27:22,231 INFO L168 Benchmark]: TraceAbstraction took 18862.58 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 212.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -99.5 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:27:22,231 INFO L168 Benchmark]: Witness Printer took 4.19 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:27:22,232 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.13 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 336.29 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 922.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 922.9 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 591.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18862.58 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 212.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -99.5 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.19 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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, 18.8s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 13.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1667 SDtfs, 2579 SDslu, 3216 SDs, 0 SdLazy, 5180 SolverSat, 259 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 701 GetRequests, 520 SyntacticMatches, 9 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 3.7s 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, 564 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 617 ConstructedInterpolants, 22 QuantifiedInterpolants, 133537 SizeOfPredicates, 169 NumberOfNonLiveVariables, 2405 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 26 InterpolantComputations, 18 PerfectInterpolantSequences, 10/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...