./Ultimate.py --spec ../../sv-benchmarks/c/Systems_DeviceDriversLinux64_ReachSafety.prp --file ../../sv-benchmarks/c/ldv-linux-3.7.3/main0_false-unreach-call_drivers--media--dvb-frontends--stv090x-ko---32_7a--linux-3.7.3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.7.3/main0_false-unreach-call_drivers--media--dvb-frontends--stv090x-ko---32_7a--linux-3.7.3.c -s /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3b71b6af0e53669e8bcddb9b77449c63f608106e ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.7.3/main0_false-unreach-call_drivers--media--dvb-frontends--stv090x-ko---32_7a--linux-3.7.3.c -s /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3b71b6af0e53669e8bcddb9b77449c63f608106e .................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: TYPE ERROR --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:01:30,089 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:01:30,091 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:01:30,099 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:01:30,099 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:01:30,100 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:01:30,101 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:01:30,102 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:01:30,103 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:01:30,104 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:01:30,104 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:01:30,105 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:01:30,105 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:01:30,106 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:01:30,107 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:01:30,107 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:01:30,107 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:01:30,108 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:01:30,110 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:01:30,111 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:01:30,111 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:01:30,112 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:01:30,114 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:01:30,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:01:30,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:01:30,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:01:30,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:01:30,116 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:01:30,117 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:01:30,118 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:01:30,118 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:01:30,118 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:01:30,118 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:01:30,118 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:01:30,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:01:30,119 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:01:30,120 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-18 13:01:30,129 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:01:30,129 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:01:30,130 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:01:30,130 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 13:01:30,130 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 13:01:30,130 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 13:01:30,130 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 13:01:30,130 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 13:01:30,130 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 13:01:30,131 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 13:01:30,131 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-18 13:01:30,131 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 13:01:30,131 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 13:01:30,131 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 13:01:30,132 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:01:30,132 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:01:30,132 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:01:30,132 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:01:30,132 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:01:30,132 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:01:30,133 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:01:30,133 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:01:30,133 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:01:30,133 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:01:30,133 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:01:30,133 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:01:30,133 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:01:30,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:01:30,134 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:01:30,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:01:30,134 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:01:30,134 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 13:01:30,134 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:01:30,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:01:30,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 13:01:30,135 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-18 13:01:30,135 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_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/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 ! call(__VERIFIER_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b71b6af0e53669e8bcddb9b77449c63f608106e [2018-11-18 13:01:30,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:01:30,169 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:01:30,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:01:30,172 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:01:30,172 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:01:30,172 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/../../sv-benchmarks/c/ldv-linux-3.7.3/main0_false-unreach-call_drivers--media--dvb-frontends--stv090x-ko---32_7a--linux-3.7.3.c [2018-11-18 13:01:30,213 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/data/7fe41ae28/1da0450c62f4440faf2925aae8e73614/FLAG7e368cd21 [2018-11-18 13:01:30,823 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:01:30,824 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/sv-benchmarks/c/ldv-linux-3.7.3/main0_false-unreach-call_drivers--media--dvb-frontends--stv090x-ko---32_7a--linux-3.7.3.c [2018-11-18 13:01:30,863 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/data/7fe41ae28/1da0450c62f4440faf2925aae8e73614/FLAG7e368cd21 [2018-11-18 13:01:31,191 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/data/7fe41ae28/1da0450c62f4440faf2925aae8e73614 [2018-11-18 13:01:31,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:01:31,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:01:31,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:01:31,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:01:31,198 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:01:31,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:01:31" (1/1) ... [2018-11-18 13:01:31,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260b373c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:31, skipping insertion in model container [2018-11-18 13:01:31,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:01:31" (1/1) ... [2018-11-18 13:01:31,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:01:31,303 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:01:34,429 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:01:34,513 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:01:36,446 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:01:36,570 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:01:36,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:36 WrapperNode [2018-11-18 13:01:36,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:01:36,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:01:36,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:01:36,571 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:01:36,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:36" (1/1) ... [2018-11-18 13:01:36,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:36" (1/1) ... [2018-11-18 13:01:36,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:01:36,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:01:36,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:01:36,681 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:01:36,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:36" (1/1) ... [2018-11-18 13:01:36,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:36" (1/1) ... [2018-11-18 13:01:36,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:36" (1/1) ... [2018-11-18 13:01:36,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:36" (1/1) ... [2018-11-18 13:01:36,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:36" (1/1) ... [2018-11-18 13:01:36,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:36" (1/1) ... [2018-11-18 13:01:36,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:36" (1/1) ... [2018-11-18 13:01:37,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:01:37,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:01:37,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:01:37,023 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:01:37,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/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-18 13:01:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_demod_lock [2018-11-18 13:01:37,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_demod_lock [2018-11-18 13:01:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_get_lock [2018-11-18 13:01:37,081 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_get_lock [2018-11-18 13:01:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_17 [2018-11-18 13:01:37,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_17 [2018-11-18 13:01:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_optimize_track [2018-11-18 13:01:37,082 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_optimize_track [2018-11-18 13:01:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_optimize_carloop_short [2018-11-18 13:01:37,082 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_optimize_carloop_short [2018-11-18 13:01:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure find_dev [2018-11-18 13:01:37,082 INFO L138 BoogieDeclarations]: Found implementation of procedure find_dev [2018-11-18 13:01:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2018-11-18 13:01:37,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2018-11-18 13:01:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_optimize_carloop [2018-11-18 13:01:37,084 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_optimize_carloop [2018-11-18 13:01:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_vitclk_ctl [2018-11-18 13:01:37,084 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_vitclk_ctl [2018-11-18 13:01:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_12 [2018-11-18 13:01:37,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_12 [2018-11-18 13:01:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_15 [2018-11-18 13:01:37,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_15 [2018-11-18 13:01:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 13:01:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2018-11-18 13:01:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_delivery_search [2018-11-18 13:01:37,085 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_delivery_search [2018-11-18 13:01:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_send_diseqc_burst [2018-11-18 13:01:37,085 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_send_diseqc_burst [2018-11-18 13:01:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_demod_lock [2018-11-18 13:01:37,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_demod_lock [2018-11-18 13:01:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_i2c_gate_ctrl [2018-11-18 13:01:37,086 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_i2c_gate_ctrl [2018-11-18 13:01:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:01:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_get_srate [2018-11-18 13:01:37,086 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_get_srate [2018-11-18 13:01:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-18 13:01:37,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-11-18 13:01:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_stop_modcod [2018-11-18 13:01:37,087 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_stop_modcod [2018-11-18 13:01:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:01:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_read_per [2018-11-18 13:01:37,087 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_read_per [2018-11-18 13:01:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_24 [2018-11-18 13:01:37,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_24 [2018-11-18 13:01:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-18 13:01:37,087 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-18 13:01:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_25 [2018-11-18 13:01:37,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_25 [2018-11-18 13:01:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_sw_algo [2018-11-18 13:01:37,088 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_sw_algo [2018-11-18 13:01:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_22 [2018-11-18 13:01:37,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_22 [2018-11-18 13:01:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_21 [2018-11-18 13:01:37,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_21 [2018-11-18 13:01:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_activate_modcod [2018-11-18 13:01:37,088 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_activate_modcod [2018-11-18 13:01:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_19 [2018-11-18 13:01:37,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_19 [2018-11-18 13:01:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_18 [2018-11-18 13:01:37,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_18 [2018-11-18 13:01:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_blind_search [2018-11-18 13:01:37,089 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_blind_search [2018-11-18 13:01:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_dvbs_track_crl [2018-11-18 13:01:37,089 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_dvbs_track_crl [2018-11-18 13:01:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_ldpc_mode [2018-11-18 13:01:37,090 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_ldpc_mode [2018-11-18 13:01:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-11-18 13:01:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_set_viterbi [2018-11-18 13:01:37,090 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_set_viterbi [2018-11-18 13:01:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_read_signal_strength [2018-11-18 13:01:37,090 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_read_signal_strength [2018-11-18 13:01:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:01:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2018-11-18 13:01:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_send_diseqc_msg [2018-11-18 13:01:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_send_diseqc_msg [2018-11-18 13:01:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_wakeup [2018-11-18 13:01:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_wakeup [2018-11-18 13:01:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-11-18 13:01:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-11-18 13:01:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_set_tspath [2018-11-18 13:01:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_set_tspath [2018-11-18 13:01:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_set_vit_thacq [2018-11-18 13:01:37,092 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_set_vit_thacq [2018-11-18 13:01:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_car_width [2018-11-18 13:01:37,092 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_car_width [2018-11-18 13:01:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_recv_slave_reply [2018-11-18 13:01:37,092 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_recv_slave_reply [2018-11-18 13:01:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_transfer [2018-11-18 13:01:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2018-11-18 13:01:37,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2018-11-18 13:01:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~TO~int [2018-11-18 13:01:37,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~TO~int [2018-11-18 13:01:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:01:37,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:01:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_init [2018-11-18 13:01:37,093 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_init [2018-11-18 13:01:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2018-11-18 13:01:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2018-11-18 13:01:37,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2018-11-18 13:01:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_set_min_srate [2018-11-18 13:01:37,094 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_set_min_srate [2018-11-18 13:01:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_get_car_freq [2018-11-18 13:01:37,094 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_get_car_freq [2018-11-18 13:01:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_get_dmdlock [2018-11-18 13:01:37,094 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_get_dmdlock [2018-11-18 13:01:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:01:37,094 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:01:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 13:01:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_sleep [2018-11-18 13:01:37,095 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_sleep [2018-11-18 13:01:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_get_feclock [2018-11-18 13:01:37,095 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_get_feclock [2018-11-18 13:01:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_read_reg [2018-11-18 13:01:37,095 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_read_reg [2018-11-18 13:01:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_chk_signal [2018-11-18 13:01:37,095 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_chk_signal [2018-11-18 13:01:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_tuner_lock [2018-11-18 13:01:37,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_tuner_lock [2018-11-18 13:01:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_release [2018-11-18 13:01:37,096 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_release [2018-11-18 13:01:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_set_s2rolloff [2018-11-18 13:01:37,096 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_set_s2rolloff [2018-11-18 13:01:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_srate_srch_fine [2018-11-18 13:01:37,096 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_srate_srch_fine [2018-11-18 13:01:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2018-11-18 13:01:37,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2018-11-18 13:01:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_start_search [2018-11-18 13:01:37,097 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_start_search [2018-11-18 13:01:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 13:01:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure comp2 [2018-11-18 13:01:37,097 INFO L138 BoogieDeclarations]: Found implementation of procedure comp2 [2018-11-18 13:01:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure remove_dev [2018-11-18 13:01:37,097 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_dev [2018-11-18 13:01:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_search [2018-11-18 13:01:37,097 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_search [2018-11-18 13:01:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_algo [2018-11-18 13:01:37,098 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_algo [2018-11-18 13:01:37,098 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_write_reg [2018-11-18 13:01:37,098 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_write_reg [2018-11-18 13:01:37,098 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_frontend_algo [2018-11-18 13:01:37,098 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_frontend_algo [2018-11-18 13:01:37,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:01:37,098 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_read_status [2018-11-18 13:01:37,098 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_read_status [2018-11-18 13:01:37,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_16 [2018-11-18 13:01:37,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_16 [2018-11-18 13:01:37,099 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_set_vit_thtracq [2018-11-18 13:01:37,099 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_set_vit_thtracq [2018-11-18 13:01:37,099 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_get_sig_params [2018-11-18 13:01:37,099 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_get_sig_params [2018-11-18 13:01:37,099 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_get_coldlock [2018-11-18 13:01:37,099 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_get_coldlock [2018-11-18 13:01:37,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_13 [2018-11-18 13:01:37,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_13 [2018-11-18 13:01:37,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_14 [2018-11-18 13:01:37,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_14 [2018-11-18 13:01:37,100 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_write_regs [2018-11-18 13:01:37,100 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_write_regs [2018-11-18 13:01:37,100 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_chk_tmg [2018-11-18 13:01:37,100 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_chk_tmg [2018-11-18 13:01:37,100 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_get_tmgoffst [2018-11-18 13:01:37,100 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_get_tmgoffst [2018-11-18 13:01:37,100 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_get_agc2_min_level [2018-11-18 13:01:37,100 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_get_agc2_min_level [2018-11-18 13:01:37,100 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_read_cnr [2018-11-18 13:01:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_read_cnr [2018-11-18 13:01:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2018-11-18 13:01:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2018-11-18 13:01:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_table_lookup [2018-11-18 13:01:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_table_lookup [2018-11-18 13:01:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_set_srate [2018-11-18 13:01:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_set_srate [2018-11-18 13:01:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_get_std [2018-11-18 13:01:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_get_std [2018-11-18 13:01:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_search_car_loop [2018-11-18 13:01:37,102 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_search_car_loop [2018-11-18 13:01:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_activate_modcod_single [2018-11-18 13:01:37,102 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_activate_modcod_single [2018-11-18 13:01:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_set_tone [2018-11-18 13:01:37,102 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_set_tone [2018-11-18 13:01:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_get_loop_params [2018-11-18 13:01:37,102 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_get_loop_params [2018-11-18 13:01:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_23 [2018-11-18 13:01:37,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_23 [2018-11-18 13:01:37,103 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_srate_srch_coarse [2018-11-18 13:01:37,103 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_srate_srch_coarse [2018-11-18 13:01:37,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2018-11-18 13:01:37,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_20 [2018-11-18 13:01:37,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_20 [2018-11-18 13:01:37,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_tuner_lock [2018-11-18 13:01:37,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_tuner_lock [2018-11-18 13:01:37,103 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_set_mis [2018-11-18 13:01:37,103 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_set_mis [2018-11-18 13:01:37,104 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_get_viterbi [2018-11-18 13:01:37,104 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_get_viterbi [2018-11-18 13:01:37,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-18 13:01:37,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-18 13:01:37,104 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_set_mclk [2018-11-18 13:01:37,104 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_set_mclk [2018-11-18 13:01:37,104 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_get_mclk [2018-11-18 13:01:37,104 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_get_mclk [2018-11-18 13:01:37,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:01:37,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:01:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_get_lock_tmg [2018-11-18 13:01:37,105 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_get_lock_tmg [2018-11-18 13:01:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure stv090x_set_max_srate [2018-11-18 13:01:37,105 INFO L138 BoogieDeclarations]: Found implementation of procedure stv090x_set_max_srate [2018-11-18 13:02:59,955 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:02:59,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:02:59 BoogieIcfgContainer [2018-11-18 13:02:59,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:02:59,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:02:59,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:02:59,959 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:02:59,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:01:31" (1/3) ... [2018-11-18 13:02:59,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723487a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:02:59, skipping insertion in model container [2018-11-18 13:02:59,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:36" (2/3) ... [2018-11-18 13:02:59,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723487a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:02:59, skipping insertion in model container [2018-11-18 13:02:59,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:02:59" (3/3) ... [2018-11-18 13:02:59,963 INFO L112 eAbstractionObserver]: Analyzing ICFG main0_false-unreach-call_drivers--media--dvb-frontends--stv090x-ko---32_7a--linux-3.7.3.c [2018-11-18 13:02:59,969 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:02:59,977 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 13:02:59,988 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 13:03:00,025 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:03:00,025 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 13:03:00,025 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:03:00,025 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:03:00,025 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:03:00,025 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:03:00,025 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:03:00,025 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:03:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 5427 states. [2018-11-18 13:03:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 13:03:00,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:03:00,090 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:03:00,091 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:03:00,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:03:00,095 INFO L82 PathProgramCache]: Analyzing trace with hash -488308540, now seen corresponding path program 1 times [2018-11-18 13:03:00,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:03:00,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:00,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:03:00,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:00,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:03:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:03:01,457 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-18 13:03:01,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:03:01,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:03:01,459 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:03:01,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:03:01,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:03:01,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:03:01,474 INFO L87 Difference]: Start difference. First operand 5427 states. Second operand 3 states. [2018-11-18 13:03:07,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:03:07,737 INFO L93 Difference]: Finished difference Result 10841 states and 17529 transitions. [2018-11-18 13:03:07,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:03:07,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 13:03:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:03:07,833 INFO L225 Difference]: With dead ends: 10841 [2018-11-18 13:03:07,833 INFO L226 Difference]: Without dead ends: 5417 [2018-11-18 13:03:07,859 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:03:07,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5417 states. [2018-11-18 13:03:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5417 to 5417. [2018-11-18 13:03:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5417 states. [2018-11-18 13:03:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5417 states to 5417 states and 8710 transitions. [2018-11-18 13:03:08,479 INFO L78 Accepts]: Start accepts. Automaton has 5417 states and 8710 transitions. Word has length 16 [2018-11-18 13:03:08,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:03:08,479 INFO L480 AbstractCegarLoop]: Abstraction has 5417 states and 8710 transitions. [2018-11-18 13:03:08,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:03:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 5417 states and 8710 transitions. [2018-11-18 13:03:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 13:03:08,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:03:08,481 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:03:08,481 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:03:08,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:03:08,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2039786451, now seen corresponding path program 1 times [2018-11-18 13:03:08,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:03:08,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:08,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:03:08,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:08,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:03:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:03:09,069 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-18 13:03:09,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:03:09,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:03:09,070 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:03:09,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:03:09,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:03:09,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:03:09,072 INFO L87 Difference]: Start difference. First operand 5417 states and 8710 transitions. Second operand 3 states. [2018-11-18 13:03:15,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:03:15,022 INFO L93 Difference]: Finished difference Result 10896 states and 17527 transitions. [2018-11-18 13:03:15,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:03:15,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 13:03:15,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:03:15,054 INFO L225 Difference]: With dead ends: 10896 [2018-11-18 13:03:15,055 INFO L226 Difference]: Without dead ends: 5489 [2018-11-18 13:03:15,083 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:03:15,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2018-11-18 13:03:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 5486. [2018-11-18 13:03:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5486 states. [2018-11-18 13:03:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5486 states to 5486 states and 8813 transitions. [2018-11-18 13:03:16,021 INFO L78 Accepts]: Start accepts. Automaton has 5486 states and 8813 transitions. Word has length 17 [2018-11-18 13:03:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:03:16,022 INFO L480 AbstractCegarLoop]: Abstraction has 5486 states and 8813 transitions. [2018-11-18 13:03:16,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:03:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 5486 states and 8813 transitions. [2018-11-18 13:03:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 13:03:16,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:03:16,023 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:03:16,023 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:03:16,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:03:16,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1193642585, now seen corresponding path program 1 times [2018-11-18 13:03:16,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:03:16,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:16,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:03:16,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:16,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:03:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:03:16,818 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-18 13:03:16,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:03:16,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:03:16,818 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:03:16,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:03:16,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:03:16,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:03:16,819 INFO L87 Difference]: Start difference. First operand 5486 states and 8813 transitions. Second operand 3 states. [2018-11-18 13:03:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:03:22,660 INFO L93 Difference]: Finished difference Result 5488 states and 8814 transitions. [2018-11-18 13:03:22,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:03:22,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 13:03:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:03:22,692 INFO L225 Difference]: With dead ends: 5488 [2018-11-18 13:03:22,692 INFO L226 Difference]: Without dead ends: 5485 [2018-11-18 13:03:22,697 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:03:22,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5485 states. [2018-11-18 13:03:23,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5485 to 5485. [2018-11-18 13:03:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5485 states. [2018-11-18 13:03:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5485 states to 5485 states and 8811 transitions. [2018-11-18 13:03:23,609 INFO L78 Accepts]: Start accepts. Automaton has 5485 states and 8811 transitions. Word has length 18 [2018-11-18 13:03:23,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:03:23,609 INFO L480 AbstractCegarLoop]: Abstraction has 5485 states and 8811 transitions. [2018-11-18 13:03:23,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:03:23,609 INFO L276 IsEmpty]: Start isEmpty. Operand 5485 states and 8811 transitions. [2018-11-18 13:03:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 13:03:23,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:03:23,610 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:03:23,610 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:03:23,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:03:23,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1649277270, now seen corresponding path program 1 times [2018-11-18 13:03:23,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:03:23,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:23,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:03:23,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:23,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:03:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:03:24,297 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-18 13:03:24,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:03:24,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:03:24,297 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:03:24,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:03:24,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:03:24,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:03:24,298 INFO L87 Difference]: Start difference. First operand 5485 states and 8811 transitions. Second operand 3 states. [2018-11-18 13:03:30,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:03:30,125 INFO L93 Difference]: Finished difference Result 5487 states and 8812 transitions. [2018-11-18 13:03:30,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:03:30,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 13:03:30,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:03:30,154 INFO L225 Difference]: With dead ends: 5487 [2018-11-18 13:03:30,154 INFO L226 Difference]: Without dead ends: 5484 [2018-11-18 13:03:30,157 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:03:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5484 states. [2018-11-18 13:03:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5484 to 5484. [2018-11-18 13:03:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5484 states. [2018-11-18 13:03:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 8809 transitions. [2018-11-18 13:03:30,979 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 8809 transitions. Word has length 19 [2018-11-18 13:03:30,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:03:30,979 INFO L480 AbstractCegarLoop]: Abstraction has 5484 states and 8809 transitions. [2018-11-18 13:03:30,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:03:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 8809 transitions. [2018-11-18 13:03:30,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 13:03:30,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:03:30,980 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:03:30,981 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:03:30,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:03:30,981 INFO L82 PathProgramCache]: Analyzing trace with hash -414515574, now seen corresponding path program 1 times [2018-11-18 13:03:30,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:03:30,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:30,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:03:30,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:30,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:03:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:03:31,673 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-18 13:03:31,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:03:31,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:03:31,673 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:03:31,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:03:31,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:03:31,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:03:31,674 INFO L87 Difference]: Start difference. First operand 5484 states and 8809 transitions. Second operand 3 states. [2018-11-18 13:03:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:03:37,588 INFO L93 Difference]: Finished difference Result 5486 states and 8810 transitions. [2018-11-18 13:03:37,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:03:37,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 13:03:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:03:37,617 INFO L225 Difference]: With dead ends: 5486 [2018-11-18 13:03:37,617 INFO L226 Difference]: Without dead ends: 5483 [2018-11-18 13:03:37,620 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:03:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2018-11-18 13:03:38,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5483. [2018-11-18 13:03:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5483 states. [2018-11-18 13:03:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5483 states to 5483 states and 8807 transitions. [2018-11-18 13:03:38,183 INFO L78 Accepts]: Start accepts. Automaton has 5483 states and 8807 transitions. Word has length 20 [2018-11-18 13:03:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:03:38,183 INFO L480 AbstractCegarLoop]: Abstraction has 5483 states and 8807 transitions. [2018-11-18 13:03:38,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:03:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5483 states and 8807 transitions. [2018-11-18 13:03:38,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 13:03:38,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:03:38,184 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:03:38,185 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:03:38,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:03:38,185 INFO L82 PathProgramCache]: Analyzing trace with hash 32420569, now seen corresponding path program 1 times [2018-11-18 13:03:38,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:03:38,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:38,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:03:38,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:38,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:03:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:03:38,709 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-18 13:03:38,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:03:38,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:03:38,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:03:38,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:03:38,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:03:38,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:03:38,710 INFO L87 Difference]: Start difference. First operand 5483 states and 8807 transitions. Second operand 3 states. [2018-11-18 13:03:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:03:44,786 INFO L93 Difference]: Finished difference Result 16409 states and 26539 transitions. [2018-11-18 13:03:44,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:03:44,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 13:03:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:03:44,832 INFO L225 Difference]: With dead ends: 16409 [2018-11-18 13:03:44,832 INFO L226 Difference]: Without dead ends: 10929 [2018-11-18 13:03:44,855 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:03:44,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10929 states. [2018-11-18 13:03:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10929 to 10918. [2018-11-18 13:03:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10918 states. [2018-11-18 13:03:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10918 states to 10918 states and 17657 transitions. [2018-11-18 13:03:45,928 INFO L78 Accepts]: Start accepts. Automaton has 10918 states and 17657 transitions. Word has length 21 [2018-11-18 13:03:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:03:45,928 INFO L480 AbstractCegarLoop]: Abstraction has 10918 states and 17657 transitions. [2018-11-18 13:03:45,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:03:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 10918 states and 17657 transitions. [2018-11-18 13:03:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 13:03:45,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:03:45,937 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:03:45,937 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:03:45,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:03:45,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1432201904, now seen corresponding path program 1 times [2018-11-18 13:03:45,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:03:45,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:45,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:03:45,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:45,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:03:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:03:46,605 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-18 13:03:46,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:03:46,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:03:46,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:03:46,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:03:46,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:03:46,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:03:46,606 INFO L87 Difference]: Start difference. First operand 10918 states and 17657 transitions. Second operand 5 states. [2018-11-18 13:03:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:03:47,271 INFO L93 Difference]: Finished difference Result 21992 states and 35808 transitions. [2018-11-18 13:03:47,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:03:47,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-11-18 13:03:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:03:47,306 INFO L225 Difference]: With dead ends: 21992 [2018-11-18 13:03:47,307 INFO L226 Difference]: Without dead ends: 11084 [2018-11-18 13:03:47,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:03:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11084 states. [2018-11-18 13:03:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11084 to 11055. [2018-11-18 13:03:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11055 states. [2018-11-18 13:03:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11055 states to 11055 states and 17888 transitions. [2018-11-18 13:03:48,327 INFO L78 Accepts]: Start accepts. Automaton has 11055 states and 17888 transitions. Word has length 72 [2018-11-18 13:03:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:03:48,327 INFO L480 AbstractCegarLoop]: Abstraction has 11055 states and 17888 transitions. [2018-11-18 13:03:48,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:03:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 11055 states and 17888 transitions. [2018-11-18 13:03:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 13:03:48,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:03:48,332 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:03:48,332 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:03:48,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:03:48,333 INFO L82 PathProgramCache]: Analyzing trace with hash 480508536, now seen corresponding path program 1 times [2018-11-18 13:03:48,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:03:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:48,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:03:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:48,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:03:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:03:49,060 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-18 13:03:49,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:03:49,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:03:49,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:03:49,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:03:49,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:03:49,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:03:49,061 INFO L87 Difference]: Start difference. First operand 11055 states and 17888 transitions. Second operand 3 states. [2018-11-18 13:03:49,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:03:49,521 INFO L93 Difference]: Finished difference Result 22116 states and 37241 transitions. [2018-11-18 13:03:49,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:03:49,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-18 13:03:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:03:49,574 INFO L225 Difference]: With dead ends: 22116 [2018-11-18 13:03:49,574 INFO L226 Difference]: Without dead ends: 11071 [2018-11-18 13:03:49,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:03:49,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11071 states. [2018-11-18 13:03:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11071 to 11059. [2018-11-18 13:03:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11059 states. [2018-11-18 13:03:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11059 states to 11059 states and 17892 transitions. [2018-11-18 13:03:50,920 INFO L78 Accepts]: Start accepts. Automaton has 11059 states and 17892 transitions. Word has length 81 [2018-11-18 13:03:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:03:50,920 INFO L480 AbstractCegarLoop]: Abstraction has 11059 states and 17892 transitions. [2018-11-18 13:03:50,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:03:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 11059 states and 17892 transitions. [2018-11-18 13:03:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 13:03:50,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:03:50,925 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:03:50,925 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:03:50,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:03:50,925 INFO L82 PathProgramCache]: Analyzing trace with hash 440204665, now seen corresponding path program 1 times [2018-11-18 13:03:50,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:03:50,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:50,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:03:50,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:50,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:03:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:03:51,541 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-18 13:03:51,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:03:51,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 13:03:51,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:03:51,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 13:03:51,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:03:51,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:03:51,543 INFO L87 Difference]: Start difference. First operand 11059 states and 17892 transitions. Second operand 7 states. [2018-11-18 13:03:51,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:03:51,859 INFO L93 Difference]: Finished difference Result 22146 states and 37663 transitions. [2018-11-18 13:03:51,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:03:51,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-11-18 13:03:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:03:51,897 INFO L225 Difference]: With dead ends: 22146 [2018-11-18 13:03:51,897 INFO L226 Difference]: Without dead ends: 11097 [2018-11-18 13:03:51,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:03:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11097 states. [2018-11-18 13:03:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11097 to 11082. [2018-11-18 13:03:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11082 states. [2018-11-18 13:03:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11082 states to 11082 states and 19480 transitions. [2018-11-18 13:03:53,924 INFO L78 Accepts]: Start accepts. Automaton has 11082 states and 19480 transitions. Word has length 81 [2018-11-18 13:03:53,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:03:53,925 INFO L480 AbstractCegarLoop]: Abstraction has 11082 states and 19480 transitions. [2018-11-18 13:03:53,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 13:03:53,925 INFO L276 IsEmpty]: Start isEmpty. Operand 11082 states and 19480 transitions. [2018-11-18 13:03:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 13:03:53,929 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:03:53,929 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:03:53,929 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:03:53,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:03:53,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1458653510, now seen corresponding path program 1 times [2018-11-18 13:03:53,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:03:53,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:53,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:03:53,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:53,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:03:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:03:54,525 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-18 13:03:54,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:03:54,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 13:03:54,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:03:54,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 13:03:54,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:03:54,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:03:54,527 INFO L87 Difference]: Start difference. First operand 11082 states and 19480 transitions. Second operand 7 states. [2018-11-18 13:03:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:03:54,874 INFO L93 Difference]: Finished difference Result 22177 states and 39259 transitions. [2018-11-18 13:03:54,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:03:54,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-11-18 13:03:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:03:54,927 INFO L225 Difference]: With dead ends: 22177 [2018-11-18 13:03:54,927 INFO L226 Difference]: Without dead ends: 11105 [2018-11-18 13:03:54,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:03:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11105 states. [2018-11-18 13:03:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11105 to 11086. [2018-11-18 13:03:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11086 states. [2018-11-18 13:03:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11086 states to 11086 states and 19484 transitions. [2018-11-18 13:03:57,089 INFO L78 Accepts]: Start accepts. Automaton has 11086 states and 19484 transitions. Word has length 81 [2018-11-18 13:03:57,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:03:57,090 INFO L480 AbstractCegarLoop]: Abstraction has 11086 states and 19484 transitions. [2018-11-18 13:03:57,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 13:03:57,090 INFO L276 IsEmpty]: Start isEmpty. Operand 11086 states and 19484 transitions. [2018-11-18 13:03:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 13:03:57,095 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:03:57,095 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:03:57,095 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:03:57,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:03:57,096 INFO L82 PathProgramCache]: Analyzing trace with hash 512147981, now seen corresponding path program 1 times [2018-11-18 13:03:57,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:03:57,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:57,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:03:57,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:03:57,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:03:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:03:57,583 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-18 13:03:57,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:03:57,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:03:57,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:03:57,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:03:57,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:03:57,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:03:57,585 INFO L87 Difference]: Start difference. First operand 11086 states and 19484 transitions. Second operand 5 states. [2018-11-18 13:03:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:03:57,794 INFO L93 Difference]: Finished difference Result 11344 states and 20044 transitions. [2018-11-18 13:03:57,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:03:57,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-11-18 13:03:57,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:03:57,839 INFO L225 Difference]: With dead ends: 11344 [2018-11-18 13:03:57,839 INFO L226 Difference]: Without dead ends: 11335 [2018-11-18 13:03:57,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:03:57,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11335 states. [2018-11-18 13:04:00,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11335 to 11092. [2018-11-18 13:04:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11092 states. [2018-11-18 13:04:00,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11092 states to 11092 states and 19513 transitions. [2018-11-18 13:04:00,189 INFO L78 Accepts]: Start accepts. Automaton has 11092 states and 19513 transitions. Word has length 83 [2018-11-18 13:04:00,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:00,190 INFO L480 AbstractCegarLoop]: Abstraction has 11092 states and 19513 transitions. [2018-11-18 13:04:00,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:04:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 11092 states and 19513 transitions. [2018-11-18 13:04:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 13:04:00,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:00,193 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:04:00,193 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:00,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:00,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1625860706, now seen corresponding path program 1 times [2018-11-18 13:04:00,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:00,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:00,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:00,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:00,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:01,079 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-18 13:04:01,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:04:01,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:04:01,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:01,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:04:01,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:04:01,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:04:01,080 INFO L87 Difference]: Start difference. First operand 11092 states and 19513 transitions. Second operand 6 states. [2018-11-18 13:04:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:01,413 INFO L93 Difference]: Finished difference Result 22278 states and 42656 transitions. [2018-11-18 13:04:01,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:04:01,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2018-11-18 13:04:01,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:01,463 INFO L225 Difference]: With dead ends: 22278 [2018-11-18 13:04:01,463 INFO L226 Difference]: Without dead ends: 11096 [2018-11-18 13:04:01,502 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:04:01,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11096 states. [2018-11-18 13:04:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11096 to 11096. [2018-11-18 13:04:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11096 states. [2018-11-18 13:04:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11096 states to 11096 states and 19517 transitions. [2018-11-18 13:04:03,618 INFO L78 Accepts]: Start accepts. Automaton has 11096 states and 19517 transitions. Word has length 84 [2018-11-18 13:04:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:03,619 INFO L480 AbstractCegarLoop]: Abstraction has 11096 states and 19517 transitions. [2018-11-18 13:04:03,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:04:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 11096 states and 19517 transitions. [2018-11-18 13:04:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 13:04:03,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:03,624 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:04:03,624 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:03,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2119051051, now seen corresponding path program 1 times [2018-11-18 13:04:03,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:03,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:03,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:03,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:03,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:09,229 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-18 13:04:09,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:04:09,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 13:04:09,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:09,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 13:04:09,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 13:04:09,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:04:09,230 INFO L87 Difference]: Start difference. First operand 11096 states and 19517 transitions. Second operand 11 states. [2018-11-18 13:04:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:44,673 INFO L93 Difference]: Finished difference Result 23358 states and 41310 transitions. [2018-11-18 13:04:44,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 13:04:44,673 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-18 13:04:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:44,732 INFO L225 Difference]: With dead ends: 23358 [2018-11-18 13:04:44,732 INFO L226 Difference]: Without dead ends: 12272 [2018-11-18 13:04:44,763 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-11-18 13:04:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12272 states. [2018-11-18 13:04:46,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12272 to 11586. [2018-11-18 13:04:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2018-11-18 13:04:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 20279 transitions. [2018-11-18 13:04:46,845 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 20279 transitions. Word has length 85 [2018-11-18 13:04:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:46,846 INFO L480 AbstractCegarLoop]: Abstraction has 11586 states and 20279 transitions. [2018-11-18 13:04:46,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 13:04:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 20279 transitions. [2018-11-18 13:04:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 13:04:46,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:46,850 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:04:46,850 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:46,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:46,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1223527147, now seen corresponding path program 1 times [2018-11-18 13:04:46,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:46,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:46,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:46,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:46,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:54,172 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-18 13:04:54,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:04:54,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:04:54,173 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2018-11-18 13:04:54,175 INFO L202 CegarAbsIntRunner]: [2246], [2249], [2252], [2254], [2263], [2266], [2268], [2274], [2277], [2282], [2288], [2291], [2297], [2328], [2335], [2337], [2341], [2430], [2433], [2439], [2481], [2488], [2540], [2541], [3031], [3035], [3037], [3038], [5531], [6436], [6437], [6440], [6441], [6707], [6708], [7015], [7018], [7031], [7038], [7041], [7124], [7127], [7133], [7585], [7588], [7643], [7647], [7651], [7712], [10602], [10604], [10605], [11714], [11718], [11720], [11722], [11735], [11737], [11740], [11795], [11799], [11803], [11805], [14319], [14324], [15504], [15505], [15508], [15509], [15514], [15515], [15526], [16320], [16321], [16326], [16350], [16944], [16945], [17098], [17100], [17101], [17102], [17103], [17560], [17622], [17623], [17624] [2018-11-18 13:04:54,231 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:04:54,231 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:04:56,827 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:291) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.AssumptionBuilder.constructBoogieAssumeStatement(AssumptionBuilder.java:75) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.getCachedCodeBlock(TermConjunctEvaluator.java:273) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:296) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:536) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-11-18 13:04:56,834 INFO L168 Benchmark]: Toolchain (without parser) took 205639.19 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 939.2 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-11-18 13:04:56,835 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:04:56,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 5374.78 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 939.2 MB in the beginning and 1.8 GB in the end (delta: -888.1 MB). Peak memory consumption was 826.8 MB. Max. memory is 11.5 GB. [2018-11-18 13:04:56,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.81 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:04:56,837 INFO L168 Benchmark]: Boogie Preprocessor took 341.40 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 89.3 MB). Peak memory consumption was 89.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:04:56,837 INFO L168 Benchmark]: RCFGBuilder took 82933.28 ms. Allocated memory was 2.0 GB in the beginning and 3.3 GB in the end (delta: 1.2 GB). Free memory was 1.7 GB in the beginning and 2.7 GB in the end (delta: -947.2 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2018-11-18 13:04:56,838 INFO L168 Benchmark]: TraceAbstraction took 116876.41 ms. Allocated memory was 3.3 GB in the beginning and 4.6 GB in the end (delta: 1.4 GB). Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 64.6 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2018-11-18 13:04:56,841 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 5374.78 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 939.2 MB in the beginning and 1.8 GB in the end (delta: -888.1 MB). Peak memory consumption was 826.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.81 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 341.40 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 89.3 MB). Peak memory consumption was 89.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 82933.28 ms. Allocated memory was 2.0 GB in the beginning and 3.3 GB in the end (delta: 1.2 GB). Free memory was 1.7 GB in the beginning and 2.7 GB in the end (delta: -947.2 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * TraceAbstraction took 116876.41 ms. Allocated memory was 3.3 GB in the beginning and 4.6 GB in the end (delta: 1.4 GB). Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 64.6 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 13:04:58,491 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:04:58,492 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:04:58,502 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:04:58,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:04:58,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:04:58,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:04:58,505 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:04:58,507 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:04:58,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:04:58,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:04:58,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:04:58,509 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:04:58,510 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:04:58,511 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:04:58,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:04:58,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:04:58,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:04:58,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:04:58,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:04:58,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:04:58,519 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:04:58,521 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:04:58,522 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:04:58,522 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:04:58,523 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:04:58,523 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:04:58,525 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:04:58,525 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:04:58,526 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:04:58,526 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:04:58,527 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:04:58,527 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:04:58,527 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:04:58,529 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:04:58,529 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:04:58,529 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Bitvector.epf [2018-11-18 13:04:58,541 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:04:58,542 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:04:58,542 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:04:58,543 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 13:04:58,543 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 13:04:58,543 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 13:04:58,543 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 13:04:58,543 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 13:04:58,543 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 13:04:58,543 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 13:04:58,545 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:04:58,545 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:04:58,545 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:04:58,546 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:04:58,546 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:04:58,546 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 13:04:58,546 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 13:04:58,546 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:04:58,546 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:04:58,547 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:04:58,547 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:04:58,547 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:04:58,547 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:04:58,547 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:04:58,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:04:58,548 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:04:58,548 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:04:58,549 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:04:58,550 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 13:04:58,550 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:04:58,550 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 13:04:58,550 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 13:04:58,550 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/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 ! call(__VERIFIER_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b71b6af0e53669e8bcddb9b77449c63f608106e [2018-11-18 13:04:58,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:04:58,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:04:58,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:04:58,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:04:58,603 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:04:58,604 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/../../sv-benchmarks/c/ldv-linux-3.7.3/main0_false-unreach-call_drivers--media--dvb-frontends--stv090x-ko---32_7a--linux-3.7.3.c [2018-11-18 13:04:58,654 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/data/41f56cce4/ad9cdbca09fe48229b1a594406093671/FLAGfbe056287 [2018-11-18 13:04:59,275 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:04:59,276 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/sv-benchmarks/c/ldv-linux-3.7.3/main0_false-unreach-call_drivers--media--dvb-frontends--stv090x-ko---32_7a--linux-3.7.3.c [2018-11-18 13:04:59,314 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/data/41f56cce4/ad9cdbca09fe48229b1a594406093671/FLAGfbe056287 [2018-11-18 13:04:59,428 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_56ae1b65-ec5e-4f8d-95a2-7bbf4408dfd5/bin-2019/utaipan/data/41f56cce4/ad9cdbca09fe48229b1a594406093671 [2018-11-18 13:04:59,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:04:59,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:04:59,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:04:59,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:04:59,436 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:04:59,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:04:59" (1/1) ... [2018-11-18 13:04:59,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae40522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:59, skipping insertion in model container [2018-11-18 13:04:59,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:04:59" (1/1) ... [2018-11-18 13:04:59,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:04:59,588 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:05:02,966 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:05:03,039 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:05:04,944 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:05:05,081 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:05:05,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:05 WrapperNode [2018-11-18 13:05:05,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:05:05,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:05:05,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:05:05,082 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:05:05,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:05" (1/1) ... [2018-11-18 13:05:05,126 ERROR L1129 TypeChecker]: C: __builtin_alloca(sizeof(*buf) * __lengthofbuf) [4219]: Wrong parameter type at index 0: CallStatement[false,[VariableLHS[#t~malloc108,]],#Ultimate.alloc,[FunctionApplication[~bvmul64,[FunctionApplication[~sign_extendFrom32To64,[BitvecLiteral[1,32]]],IdentifierExpression[~__lengthofbuf~0,]]]]] [2018-11-18 13:05:05,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:05" (1/1) ... [2018-11-18 13:05:05,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:05:05,168 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2018-11-18 13:05:05,169 INFO L168 Benchmark]: Toolchain (without parser) took 5737.56 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 806.4 MB). Free memory was 926.4 MB in the beginning and 925.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 807.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:05:05,171 INFO L168 Benchmark]: CDTParser took 0.18 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-18 13:05:05,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 5648.89 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 806.4 MB). Free memory was 926.4 MB in the beginning and 946.3 MB in the end (delta: -19.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 13:05:05,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.77 ms. Allocated memory is still 1.8 GB. Free memory was 946.3 MB in the beginning and 925.1 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:05:05,175 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 5648.89 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 806.4 MB). Free memory was 926.4 MB in the beginning and 946.3 MB in the end (delta: -19.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.77 ms. Allocated memory is still 1.8 GB. Free memory was 946.3 MB in the beginning and 925.1 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - TypeErrorResult [Line: 4219]: Type Error Wrong parameter type at index 0: CallStatement[false,[VariableLHS[#t~malloc108,]],#Ultimate.alloc,[FunctionApplication[~bvmul64,[FunctionApplication[~sign_extendFrom32To64,[BitvecLiteral[1,32]]],IdentifierExpression[~__lengthofbuf~0,]]]]] RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...