./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 07:26:16,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:26:16,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:26:16,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:26:16,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:26:16,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:26:16,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:26:16,093 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:26:16,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:26:16,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:26:16,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:26:16,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:26:16,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:26:16,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:26:16,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:26:16,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:26:16,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:26:16,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:26:16,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:26:16,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:26:16,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:26:16,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:26:16,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:26:16,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:26:16,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:26:16,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:26:16,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:26:16,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:26:16,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:26:16,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:26:16,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:26:16,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:26:16,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:26:16,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:26:16,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:26:16,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:26:16,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:26:16,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:26:16,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:26:16,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:26:16,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:26:16,166 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 07:26:16,207 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:26:16,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:26:16,208 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:26:16,208 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:26:16,209 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:26:16,209 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:26:16,210 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:26:16,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:26:16,211 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:26:16,211 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:26:16,211 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 07:26:16,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 07:26:16,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 07:26:16,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:26:16,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 07:26:16,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:26:16,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 07:26:16,213 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 07:26:16,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 07:26:16,214 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:26:16,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 07:26:16,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:26:16,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:26:16,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:26:16,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:26:16,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:26:16,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:26:16,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 07:26:16,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 07:26:16,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 07:26:16,217 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 07:26:16,217 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 07:26:16,217 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 07:26:16,217 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:26:16,218 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2021-11-20 07:26:16,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:26:16,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:26:16,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:26:16,624 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:26:16,625 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:26:16,628 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2021-11-20 07:26:16,713 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/data/aa00d32e4/eea880e964d444eab099c5c754ecc07a/FLAGf8d723467 [2021-11-20 07:26:17,403 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:26:17,412 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2021-11-20 07:26:17,429 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/data/aa00d32e4/eea880e964d444eab099c5c754ecc07a/FLAGf8d723467 [2021-11-20 07:26:17,734 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/data/aa00d32e4/eea880e964d444eab099c5c754ecc07a [2021-11-20 07:26:17,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:26:17,738 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:26:17,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:26:17,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:26:17,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:26:17,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:26:17" (1/1) ... [2021-11-20 07:26:17,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2edb3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:17, skipping insertion in model container [2021-11-20 07:26:17,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:26:17" (1/1) ... [2021-11-20 07:26:17,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:26:17,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:26:17,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2021-11-20 07:26:18,030 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:26:18,043 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:26:18,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2021-11-20 07:26:18,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:26:18,126 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:26:18,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:18 WrapperNode [2021-11-20 07:26:18,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:26:18,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:26:18,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:26:18,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:26:18,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:18" (1/1) ... [2021-11-20 07:26:18,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:18" (1/1) ... [2021-11-20 07:26:18,170 INFO L137 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 225 [2021-11-20 07:26:18,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:26:18,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:26:18,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:26:18,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:26:18,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:18" (1/1) ... [2021-11-20 07:26:18,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:18" (1/1) ... [2021-11-20 07:26:18,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:18" (1/1) ... [2021-11-20 07:26:18,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:18" (1/1) ... [2021-11-20 07:26:18,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:18" (1/1) ... [2021-11-20 07:26:18,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:18" (1/1) ... [2021-11-20 07:26:18,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:18" (1/1) ... [2021-11-20 07:26:18,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:26:18,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:26:18,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:26:18,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:26:18,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:18" (1/1) ... [2021-11-20 07:26:18,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:26:18,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:18,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:26:18,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:26:18,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:26:18,320 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-11-20 07:26:18,320 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-11-20 07:26:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-11-20 07:26:18,321 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-11-20 07:26:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-11-20 07:26:18,321 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-11-20 07:26:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-11-20 07:26:18,322 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-11-20 07:26:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-11-20 07:26:18,322 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-11-20 07:26:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-11-20 07:26:18,323 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-11-20 07:26:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 07:26:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-11-20 07:26:18,323 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-11-20 07:26:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:26:18,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:26:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-11-20 07:26:18,324 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-11-20 07:26:18,435 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:26:18,437 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:26:18,824 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2021-11-20 07:26:18,825 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2021-11-20 07:26:18,843 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:26:18,851 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:26:18,851 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-20 07:26:18,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:18 BoogieIcfgContainer [2021-11-20 07:26:18,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:26:18,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:26:18,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:26:18,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:26:18,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:26:17" (1/3) ... [2021-11-20 07:26:18,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbd62b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:26:18, skipping insertion in model container [2021-11-20 07:26:18,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:18" (2/3) ... [2021-11-20 07:26:18,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbd62b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:26:18, skipping insertion in model container [2021-11-20 07:26:18,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:18" (3/3) ... [2021-11-20 07:26:18,871 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2021-11-20 07:26:18,876 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:26:18,876 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 07:26:18,946 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:26:18,962 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 07:26:18,962 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 07:26:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2021-11-20 07:26:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-20 07:26:19,011 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:19,012 INFO L514 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] [2021-11-20 07:26:19,013 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:19,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:19,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1330697302, now seen corresponding path program 1 times [2021-11-20 07:26:19,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:19,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508071925] [2021-11-20 07:26:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:19,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:19,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:19,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:19,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:26:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:19,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:19,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:26:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:19,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-20 07:26:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:19,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-20 07:26:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:19,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:19,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508071925] [2021-11-20 07:26:19,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508071925] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:19,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:19,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 07:26:19,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711472714] [2021-11-20 07:26:19,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:19,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 07:26:19,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:19,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 07:26:19,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:19,621 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:20,480 INFO L93 Difference]: Finished difference Result 382 states and 574 transitions. [2021-11-20 07:26:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 07:26:20,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2021-11-20 07:26:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:20,503 INFO L225 Difference]: With dead ends: 382 [2021-11-20 07:26:20,504 INFO L226 Difference]: Without dead ends: 264 [2021-11-20 07:26:20,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-11-20 07:26:20,513 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 366 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:20,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 638 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-20 07:26:20,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-11-20 07:26:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 225. [2021-11-20 07:26:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 179 states have (on average 1.4245810055865922) internal successors, (255), 183 states have internal predecessors, (255), 29 states have call successors, (29), 15 states have call predecessors, (29), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2021-11-20 07:26:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2021-11-20 07:26:20,606 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 64 [2021-11-20 07:26:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:20,607 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2021-11-20 07:26:20,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2021-11-20 07:26:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-20 07:26:20,613 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:20,614 INFO L514 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] [2021-11-20 07:26:20,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 07:26:20,615 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1285381354, now seen corresponding path program 1 times [2021-11-20 07:26:20,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:20,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744393848] [2021-11-20 07:26:20,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:20,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:20,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:20,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:26:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:20,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:20,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:26:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:20,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-20 07:26:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:20,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-20 07:26:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:20,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:20,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744393848] [2021-11-20 07:26:20,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744393848] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:20,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:20,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 07:26:20,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330207569] [2021-11-20 07:26:20,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:20,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 07:26:20,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:20,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 07:26:20,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:20,843 INFO L87 Difference]: Start difference. First operand 225 states and 316 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:21,770 INFO L93 Difference]: Finished difference Result 622 states and 882 transitions. [2021-11-20 07:26:21,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 07:26:21,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2021-11-20 07:26:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:21,777 INFO L225 Difference]: With dead ends: 622 [2021-11-20 07:26:21,777 INFO L226 Difference]: Without dead ends: 413 [2021-11-20 07:26:21,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-11-20 07:26:21,781 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 451 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:21,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 893 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 07:26:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-11-20 07:26:21,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 337. [2021-11-20 07:26:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 269 states have (on average 1.41635687732342) internal successors, (381), 275 states have internal predecessors, (381), 42 states have call successors, (42), 22 states have call predecessors, (42), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2021-11-20 07:26:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 476 transitions. [2021-11-20 07:26:21,842 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 476 transitions. Word has length 64 [2021-11-20 07:26:21,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:21,842 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 476 transitions. [2021-11-20 07:26:21,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:21,843 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 476 transitions. [2021-11-20 07:26:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-20 07:26:21,856 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:21,856 INFO L514 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] [2021-11-20 07:26:21,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 07:26:21,857 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:21,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:21,857 INFO L85 PathProgramCache]: Analyzing trace with hash 980999832, now seen corresponding path program 1 times [2021-11-20 07:26:21,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:21,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045306981] [2021-11-20 07:26:21,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:21,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:21,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:21,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:22,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:26:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:22,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:22,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:26:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:22,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-20 07:26:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-20 07:26:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:22,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:22,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045306981] [2021-11-20 07:26:22,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045306981] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:22,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:22,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-20 07:26:22,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293931831] [2021-11-20 07:26:22,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:22,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 07:26:22,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:22,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 07:26:22,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:26:22,094 INFO L87 Difference]: Start difference. First operand 337 states and 476 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-20 07:26:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:23,945 INFO L93 Difference]: Finished difference Result 1883 states and 2674 transitions. [2021-11-20 07:26:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-20 07:26:23,946 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2021-11-20 07:26:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:23,963 INFO L225 Difference]: With dead ends: 1883 [2021-11-20 07:26:23,963 INFO L226 Difference]: Without dead ends: 1550 [2021-11-20 07:26:23,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-11-20 07:26:23,972 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 1613 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:23,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1631 Valid, 1188 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-20 07:26:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2021-11-20 07:26:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1390. [2021-11-20 07:26:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1117 states have (on average 1.3652641002685766) internal successors, (1525), 1138 states have internal predecessors, (1525), 152 states have call successors, (152), 105 states have call predecessors, (152), 120 states have return successors, (186), 148 states have call predecessors, (186), 150 states have call successors, (186) [2021-11-20 07:26:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1863 transitions. [2021-11-20 07:26:24,187 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1863 transitions. Word has length 64 [2021-11-20 07:26:24,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:24,188 INFO L470 AbstractCegarLoop]: Abstraction has 1390 states and 1863 transitions. [2021-11-20 07:26:24,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-20 07:26:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1863 transitions. [2021-11-20 07:26:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-20 07:26:24,191 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:24,191 INFO L514 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] [2021-11-20 07:26:24,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 07:26:24,192 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:24,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:24,192 INFO L85 PathProgramCache]: Analyzing trace with hash 779831852, now seen corresponding path program 1 times [2021-11-20 07:26:24,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:24,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319965303] [2021-11-20 07:26:24,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:24,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:24,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:24,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:24,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:26:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:24,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:24,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:24,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 07:26:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:24,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 07:26:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:24,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:24,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319965303] [2021-11-20 07:26:24,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319965303] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:24,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:24,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 07:26:24,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501901018] [2021-11-20 07:26:24,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:24,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 07:26:24,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:24,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 07:26:24,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:26:24,419 INFO L87 Difference]: Start difference. First operand 1390 states and 1863 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 07:26:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:25,026 INFO L93 Difference]: Finished difference Result 2918 states and 3942 transitions. [2021-11-20 07:26:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 07:26:25,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2021-11-20 07:26:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:25,043 INFO L225 Difference]: With dead ends: 2918 [2021-11-20 07:26:25,043 INFO L226 Difference]: Without dead ends: 1538 [2021-11-20 07:26:25,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-11-20 07:26:25,064 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 130 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:25,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 748 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 07:26:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2021-11-20 07:26:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1430. [2021-11-20 07:26:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1149 states have (on average 1.349869451697128) internal successors, (1551), 1170 states have internal predecessors, (1551), 152 states have call successors, (152), 105 states have call predecessors, (152), 128 states have return successors, (194), 156 states have call predecessors, (194), 150 states have call successors, (194) [2021-11-20 07:26:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1897 transitions. [2021-11-20 07:26:25,213 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1897 transitions. Word has length 65 [2021-11-20 07:26:25,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:25,214 INFO L470 AbstractCegarLoop]: Abstraction has 1430 states and 1897 transitions. [2021-11-20 07:26:25,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 07:26:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1897 transitions. [2021-11-20 07:26:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-20 07:26:25,218 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:25,218 INFO L514 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] [2021-11-20 07:26:25,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 07:26:25,219 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:25,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:25,220 INFO L85 PathProgramCache]: Analyzing trace with hash -249527446, now seen corresponding path program 1 times [2021-11-20 07:26:25,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:25,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246688420] [2021-11-20 07:26:25,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:25,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:25,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:25,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:25,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:26:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:25,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:25,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:25,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 07:26:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:25,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 07:26:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:25,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:25,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246688420] [2021-11-20 07:26:25,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246688420] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:25,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:25,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-20 07:26:25,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355801298] [2021-11-20 07:26:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:25,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 07:26:25,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:25,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 07:26:25,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:26:25,406 INFO L87 Difference]: Start difference. First operand 1430 states and 1897 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 07:26:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:27,286 INFO L93 Difference]: Finished difference Result 5002 states and 6771 transitions. [2021-11-20 07:26:27,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-20 07:26:27,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2021-11-20 07:26:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:27,303 INFO L225 Difference]: With dead ends: 5002 [2021-11-20 07:26:27,303 INFO L226 Difference]: Without dead ends: 1821 [2021-11-20 07:26:27,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-11-20 07:26:27,316 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 1515 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:27,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1533 Valid, 1368 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-20 07:26:27,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2021-11-20 07:26:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1641. [2021-11-20 07:26:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1288 states have (on average 1.3020186335403727) internal successors, (1677), 1311 states have internal predecessors, (1677), 192 states have call successors, (192), 133 states have call predecessors, (192), 160 states have return successors, (240), 198 states have call predecessors, (240), 190 states have call successors, (240) [2021-11-20 07:26:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2109 transitions. [2021-11-20 07:26:27,491 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2109 transitions. Word has length 65 [2021-11-20 07:26:27,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:27,491 INFO L470 AbstractCegarLoop]: Abstraction has 1641 states and 2109 transitions. [2021-11-20 07:26:27,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 07:26:27,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2109 transitions. [2021-11-20 07:26:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-20 07:26:27,495 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:27,495 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:27,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 07:26:27,496 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:27,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:27,497 INFO L85 PathProgramCache]: Analyzing trace with hash -31264562, now seen corresponding path program 1 times [2021-11-20 07:26:27,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:27,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564994484] [2021-11-20 07:26:27,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:27,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:27,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:27,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:27,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:26:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:27,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:27,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:27,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-20 07:26:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:27,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-20 07:26:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:27,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 07:26:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-20 07:26:27,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:27,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564994484] [2021-11-20 07:26:27,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564994484] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:27,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:27,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 07:26:27,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47913775] [2021-11-20 07:26:27,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:27,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 07:26:27,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:27,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 07:26:27,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:26:27,706 INFO L87 Difference]: Start difference. First operand 1641 states and 2109 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 07:26:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:28,275 INFO L93 Difference]: Finished difference Result 3466 states and 4511 transitions. [2021-11-20 07:26:28,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 07:26:28,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2021-11-20 07:26:28,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:28,292 INFO L225 Difference]: With dead ends: 3466 [2021-11-20 07:26:28,293 INFO L226 Difference]: Without dead ends: 1835 [2021-11-20 07:26:28,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-11-20 07:26:28,312 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 182 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:28,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 618 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 07:26:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2021-11-20 07:26:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1701. [2021-11-20 07:26:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1336 states have (on average 1.2866766467065869) internal successors, (1719), 1359 states have internal predecessors, (1719), 192 states have call successors, (192), 133 states have call predecessors, (192), 172 states have return successors, (252), 210 states have call predecessors, (252), 190 states have call successors, (252) [2021-11-20 07:26:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2163 transitions. [2021-11-20 07:26:28,483 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2163 transitions. Word has length 90 [2021-11-20 07:26:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:28,486 INFO L470 AbstractCegarLoop]: Abstraction has 1701 states and 2163 transitions. [2021-11-20 07:26:28,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 07:26:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2163 transitions. [2021-11-20 07:26:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-20 07:26:28,489 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:28,489 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:28,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 07:26:28,490 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:28,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash 412636112, now seen corresponding path program 1 times [2021-11-20 07:26:28,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:28,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030111863] [2021-11-20 07:26:28,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:28,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:28,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:28,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:28,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:26:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:28,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:28,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:28,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-20 07:26:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:28,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-20 07:26:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:28,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 07:26:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-20 07:26:28,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:28,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030111863] [2021-11-20 07:26:28,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030111863] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:28,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:28,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 07:26:28,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111819092] [2021-11-20 07:26:28,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:28,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 07:26:28,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:28,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 07:26:28,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:28,677 INFO L87 Difference]: Start difference. First operand 1701 states and 2163 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:29,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:29,636 INFO L93 Difference]: Finished difference Result 3228 states and 4127 transitions. [2021-11-20 07:26:29,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 07:26:29,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2021-11-20 07:26:29,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:29,653 INFO L225 Difference]: With dead ends: 3228 [2021-11-20 07:26:29,654 INFO L226 Difference]: Without dead ends: 1775 [2021-11-20 07:26:29,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-11-20 07:26:29,661 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 365 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:29,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 679 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-20 07:26:29,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2021-11-20 07:26:29,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1480. [2021-11-20 07:26:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1168 states have (on average 1.2851027397260273) internal successors, (1501), 1186 states have internal predecessors, (1501), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2021-11-20 07:26:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1877 transitions. [2021-11-20 07:26:29,792 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1877 transitions. Word has length 90 [2021-11-20 07:26:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:29,793 INFO L470 AbstractCegarLoop]: Abstraction has 1480 states and 1877 transitions. [2021-11-20 07:26:29,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1877 transitions. [2021-11-20 07:26:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-20 07:26:29,795 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:29,796 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:29,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 07:26:29,796 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:29,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:29,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1943169138, now seen corresponding path program 1 times [2021-11-20 07:26:29,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:29,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798515924] [2021-11-20 07:26:29,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:29,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:29,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:29,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:29,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:26:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:29,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:29,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-20 07:26:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:29,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-20 07:26:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:29,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 07:26:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-20 07:26:29,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:29,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798515924] [2021-11-20 07:26:29,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798515924] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:29,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:29,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:26:29,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601101055] [2021-11-20 07:26:29,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:29,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:26:29,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:29,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:26:29,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:26:29,939 INFO L87 Difference]: Start difference. First operand 1480 states and 1877 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-20 07:26:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:30,641 INFO L93 Difference]: Finished difference Result 4632 states and 5989 transitions. [2021-11-20 07:26:30,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 07:26:30,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2021-11-20 07:26:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:30,671 INFO L225 Difference]: With dead ends: 4632 [2021-11-20 07:26:30,671 INFO L226 Difference]: Without dead ends: 3163 [2021-11-20 07:26:30,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-11-20 07:26:30,679 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 365 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:30,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 515 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 07:26:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2021-11-20 07:26:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2949. [2021-11-20 07:26:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2317 states have (on average 1.2641346568839016) internal successors, (2929), 2364 states have internal predecessors, (2929), 325 states have call successors, (325), 227 states have call predecessors, (325), 306 states have return successors, (495), 359 states have call predecessors, (495), 323 states have call successors, (495) [2021-11-20 07:26:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3749 transitions. [2021-11-20 07:26:30,960 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3749 transitions. Word has length 90 [2021-11-20 07:26:30,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:30,960 INFO L470 AbstractCegarLoop]: Abstraction has 2949 states and 3749 transitions. [2021-11-20 07:26:30,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-20 07:26:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3749 transitions. [2021-11-20 07:26:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-20 07:26:30,964 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:30,965 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:30,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 07:26:30,965 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:30,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1293960080, now seen corresponding path program 1 times [2021-11-20 07:26:30,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:30,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103248649] [2021-11-20 07:26:30,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:30,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:30,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:26:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-20 07:26:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-20 07:26:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 07:26:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-20 07:26:31,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:31,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103248649] [2021-11-20 07:26:31,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103248649] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:31,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:31,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:26:31,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806236704] [2021-11-20 07:26:31,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:31,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:26:31,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:31,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:26:31,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:26:31,038 INFO L87 Difference]: Start difference. First operand 2949 states and 3749 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:31,295 INFO L93 Difference]: Finished difference Result 4533 states and 5733 transitions. [2021-11-20 07:26:31,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:26:31,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2021-11-20 07:26:31,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:31,308 INFO L225 Difference]: With dead ends: 4533 [2021-11-20 07:26:31,308 INFO L226 Difference]: Without dead ends: 1595 [2021-11-20 07:26:31,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:26:31,319 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 290 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:31,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 243 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:26:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2021-11-20 07:26:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1480. [2021-11-20 07:26:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1168 states have (on average 1.2534246575342465) internal successors, (1464), 1186 states have internal predecessors, (1464), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2021-11-20 07:26:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1840 transitions. [2021-11-20 07:26:31,448 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1840 transitions. Word has length 90 [2021-11-20 07:26:31,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:31,448 INFO L470 AbstractCegarLoop]: Abstraction has 1480 states and 1840 transitions. [2021-11-20 07:26:31,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1840 transitions. [2021-11-20 07:26:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-20 07:26:31,451 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:31,451 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:31,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 07:26:31,451 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1668589887, now seen corresponding path program 1 times [2021-11-20 07:26:31,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:31,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784160118] [2021-11-20 07:26:31,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:31,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:26:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-20 07:26:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-20 07:26:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-20 07:26:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 07:26:31,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:31,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784160118] [2021-11-20 07:26:31,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784160118] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:31,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:31,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 07:26:31,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266525428] [2021-11-20 07:26:31,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:31,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 07:26:31,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:31,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 07:26:31,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:26:31,579 INFO L87 Difference]: Start difference. First operand 1480 states and 1840 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-20 07:26:32,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:32,719 INFO L93 Difference]: Finished difference Result 3898 states and 4923 transitions. [2021-11-20 07:26:32,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-20 07:26:32,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 91 [2021-11-20 07:26:32,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:32,735 INFO L225 Difference]: With dead ends: 3898 [2021-11-20 07:26:32,735 INFO L226 Difference]: Without dead ends: 2278 [2021-11-20 07:26:32,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2021-11-20 07:26:32,741 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 1314 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:32,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1332 Valid, 610 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 07:26:32,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2021-11-20 07:26:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2101. [2021-11-20 07:26:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2101 states, 1635 states have (on average 1.2269113149847095) internal successors, (2006), 1661 states have internal predecessors, (2006), 241 states have call successors, (241), 162 states have call predecessors, (241), 224 states have return successors, (343), 278 states have call predecessors, (343), 239 states have call successors, (343) [2021-11-20 07:26:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2590 transitions. [2021-11-20 07:26:32,885 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2590 transitions. Word has length 91 [2021-11-20 07:26:32,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:32,885 INFO L470 AbstractCegarLoop]: Abstraction has 2101 states and 2590 transitions. [2021-11-20 07:26:32,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-20 07:26:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2590 transitions. [2021-11-20 07:26:32,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-20 07:26:32,889 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:32,889 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:32,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 07:26:32,889 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:32,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:32,892 INFO L85 PathProgramCache]: Analyzing trace with hash -633049043, now seen corresponding path program 1 times [2021-11-20 07:26:32,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:32,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841133527] [2021-11-20 07:26:32,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:32,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:32,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:32,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:32,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:26:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:32,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:32,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:32,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-20 07:26:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-20 07:26:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:32,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-20 07:26:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:33,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-20 07:26:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:33,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 07:26:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:33,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-20 07:26:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:33,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:33,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:26:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:33,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-20 07:26:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:33,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-20 07:26:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:33,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-20 07:26:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:33,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-20 07:26:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-20 07:26:33,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:33,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841133527] [2021-11-20 07:26:33,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841133527] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:33,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548672326] [2021-11-20 07:26:33,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:33,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:33,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:33,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:33,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 07:26:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:33,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 07:26:33,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-20 07:26:33,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:26:33,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548672326] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:33,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:26:33,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-11-20 07:26:33,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33528392] [2021-11-20 07:26:33,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:33,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:26:33,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:33,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:26:33,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:26:33,829 INFO L87 Difference]: Start difference. First operand 2101 states and 2590 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-20 07:26:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:34,054 INFO L93 Difference]: Finished difference Result 6027 states and 7419 transitions. [2021-11-20 07:26:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:26:34,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2021-11-20 07:26:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:34,087 INFO L225 Difference]: With dead ends: 6027 [2021-11-20 07:26:34,088 INFO L226 Difference]: Without dead ends: 4013 [2021-11-20 07:26:34,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:26:34,098 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 61 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:34,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 281 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:26:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2021-11-20 07:26:34,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3971. [2021-11-20 07:26:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3092 states have (on average 1.2160413971539457) internal successors, (3760), 3141 states have internal predecessors, (3760), 448 states have call successors, (448), 323 states have call predecessors, (448), 430 states have return successors, (611), 507 states have call predecessors, (611), 446 states have call successors, (611) [2021-11-20 07:26:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4819 transitions. [2021-11-20 07:26:34,524 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4819 transitions. Word has length 162 [2021-11-20 07:26:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:34,525 INFO L470 AbstractCegarLoop]: Abstraction has 3971 states and 4819 transitions. [2021-11-20 07:26:34,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-20 07:26:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4819 transitions. [2021-11-20 07:26:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-20 07:26:34,530 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:34,531 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:34,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 07:26:34,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-20 07:26:34,751 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:34,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1912569076, now seen corresponding path program 1 times [2021-11-20 07:26:34,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:34,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953898758] [2021-11-20 07:26:34,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:34,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:26:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-20 07:26:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-20 07:26:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-20 07:26:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-20 07:26:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 07:26:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-20 07:26:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:26:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-20 07:26:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-20 07:26:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-20 07:26:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:26:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-11-20 07:26:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-11-20 07:26:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-11-20 07:26:34,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:34,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953898758] [2021-11-20 07:26:34,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953898758] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:34,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623764564] [2021-11-20 07:26:34,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:34,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:34,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:34,968 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:34,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 07:26:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:35,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 07:26:35,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-11-20 07:26:35,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:26:35,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623764564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:35,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:26:35,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-11-20 07:26:35,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373997914] [2021-11-20 07:26:35,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:35,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:26:35,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:35,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:26:35,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:26:35,778 INFO L87 Difference]: Start difference. First operand 3971 states and 4819 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-20 07:26:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:36,273 INFO L93 Difference]: Finished difference Result 11891 states and 14427 transitions. [2021-11-20 07:26:36,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:26:36,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 194 [2021-11-20 07:26:36,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:36,343 INFO L225 Difference]: With dead ends: 11891 [2021-11-20 07:26:36,345 INFO L226 Difference]: Without dead ends: 7931 [2021-11-20 07:26:36,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:26:36,360 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 52 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:36,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 281 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:26:36,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2021-11-20 07:26:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7921. [2021-11-20 07:26:36,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7921 states, 6170 states have (on average 1.2092382495948135) internal successors, (7461), 6266 states have internal predecessors, (7461), 890 states have call successors, (890), 645 states have call predecessors, (890), 860 states have return successors, (1218), 1010 states have call predecessors, (1218), 888 states have call successors, (1218) [2021-11-20 07:26:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 9569 transitions. [2021-11-20 07:26:36,959 INFO L78 Accepts]: Start accepts. Automaton has 7921 states and 9569 transitions. Word has length 194 [2021-11-20 07:26:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:36,960 INFO L470 AbstractCegarLoop]: Abstraction has 7921 states and 9569 transitions. [2021-11-20 07:26:36,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-20 07:26:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand 7921 states and 9569 transitions. [2021-11-20 07:26:36,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-20 07:26:36,967 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:36,968 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:37,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 07:26:37,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-20 07:26:37,183 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:37,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:37,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1015175798, now seen corresponding path program 1 times [2021-11-20 07:26:37,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:37,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612483204] [2021-11-20 07:26:37,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:37,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:26:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-20 07:26:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-20 07:26:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-20 07:26:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-20 07:26:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 07:26:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-20 07:26:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:26:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-20 07:26:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-20 07:26:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-20 07:26:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:26:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-11-20 07:26:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-11-20 07:26:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-11-20 07:26:37,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:37,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612483204] [2021-11-20 07:26:37,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612483204] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:37,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460500770] [2021-11-20 07:26:37,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:37,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:37,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:37,375 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:37,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 07:26:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:37,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 07:26:37,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-11-20 07:26:38,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:26:38,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460500770] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:38,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:26:38,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-11-20 07:26:38,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515023273] [2021-11-20 07:26:38,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:38,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:26:38,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:38,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:26:38,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:26:38,076 INFO L87 Difference]: Start difference. First operand 7921 states and 9569 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-11-20 07:26:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:38,632 INFO L93 Difference]: Finished difference Result 14427 states and 17761 transitions. [2021-11-20 07:26:38,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:26:38,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 194 [2021-11-20 07:26:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:38,654 INFO L225 Difference]: With dead ends: 14427 [2021-11-20 07:26:38,655 INFO L226 Difference]: Without dead ends: 0 [2021-11-20 07:26:38,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:26:38,687 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:38,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 129 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:26:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-20 07:26:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-20 07:26:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:26:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-20 07:26:38,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 194 [2021-11-20 07:26:38,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:38,692 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-20 07:26:38,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-11-20 07:26:38,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-20 07:26:38,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-20 07:26:38,696 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 07:26:38,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 07:26:38,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:38,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-20 07:27:26,515 INFO L854 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or (not (<= ~c_dr_pc~0 0)) (not (= |old(~c_dr_st~0)| 0)) .cse0 (not (= 1 ~c_dr_i~0))) (or .cse0 (not (= ~c_dr_pc~0 1))))) [2021-11-20 07:27:26,515 INFO L854 garLoopResultBuilder]: At program point L387-2(lines 387 391) the Hoare annotation is: (let ((.cse6 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse7 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse0 (and .cse6 (< 0 (+ activate_threads_~tmp~1 1)) .cse7 (<= activate_threads_~tmp~1 0))) (.cse2 (not (= ~q_read_ev~0 2))) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse4 (not (= |old(~c_dr_st~0)| 0))) (.cse1 (= ~p_dw_pc~0 1)) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 1)) .cse2) (or .cse3 .cse4 .cse0 .cse1 .cse2 .cse5) (or .cse3 .cse4 (and .cse6 .cse7) (and .cse7 .cse8) .cse5) (or .cse3 (not .cse8) .cse4 (= |old(~p_dw_st~0)| 0) (not (<= 2 ~fast_clk_edge~0)) (not .cse1) .cse5)))) [2021-11-20 07:27:26,515 INFO L858 garLoopResultBuilder]: For program point L385-1(line 385) no Hoare annotation was computed. [2021-11-20 07:27:26,515 INFO L854 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 379 403) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or (not (<= ~c_dr_pc~0 0)) (not (= |old(~c_dr_st~0)| 0)) .cse0 (not (= 1 ~c_dr_i~0))) (or .cse0 (not (= ~c_dr_pc~0 1))))) [2021-11-20 07:27:26,515 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2021-11-20 07:27:26,515 INFO L858 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 379 403) no Hoare annotation was computed. [2021-11-20 07:27:26,515 INFO L858 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2021-11-20 07:27:26,516 INFO L858 garLoopResultBuilder]: For program point L395-2(lines 379 403) no Hoare annotation was computed. [2021-11-20 07:27:26,516 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2021-11-20 07:27:26,516 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 287 306) no Hoare annotation was computed. [2021-11-20 07:27:26,516 INFO L861 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 287 306) the Hoare annotation is: true [2021-11-20 07:27:26,516 INFO L861 garLoopResultBuilder]: At program point L303(lines 290 305) the Hoare annotation is: true [2021-11-20 07:27:26,516 INFO L858 garLoopResultBuilder]: For program point L295(lines 295 300) no Hoare annotation was computed. [2021-11-20 07:27:26,516 INFO L858 garLoopResultBuilder]: For program point L291(lines 291 301) no Hoare annotation was computed. [2021-11-20 07:27:26,516 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 287 306) no Hoare annotation was computed. [2021-11-20 07:27:26,516 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2021-11-20 07:27:26,516 INFO L858 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2021-11-20 07:27:26,517 INFO L858 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2021-11-20 07:27:26,517 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 91 119) the Hoare annotation is: true [2021-11-20 07:27:26,517 INFO L854 garLoopResultBuilder]: At program point L116(lines 94 118) the Hoare annotation is: (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1)) (not (= 1 ~c_dr_i~0))) [2021-11-20 07:27:26,517 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 91 119) no Hoare annotation was computed. [2021-11-20 07:27:26,517 INFO L858 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2021-11-20 07:27:26,517 INFO L858 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2021-11-20 07:27:26,517 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 91 119) no Hoare annotation was computed. [2021-11-20 07:27:26,517 INFO L854 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 307 324) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) .cse0 (not (= 1 ~c_dr_i~0))))) [2021-11-20 07:27:26,517 INFO L858 garLoopResultBuilder]: For program point L316-1(lines 307 324) no Hoare annotation was computed. [2021-11-20 07:27:26,518 INFO L858 garLoopResultBuilder]: For program point L311-1(lines 310 323) no Hoare annotation was computed. [2021-11-20 07:27:26,518 INFO L858 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 307 324) no Hoare annotation was computed. [2021-11-20 07:27:26,518 INFO L858 garLoopResultBuilder]: For program point L258-1(lines 254 268) no Hoare annotation was computed. [2021-11-20 07:27:26,518 INFO L854 garLoopResultBuilder]: At program point L49(lines 32 51) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_pc~0 1))) (.cse0 (= ~q_req_up~0 0)) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse2 (not (= |old(~q_req_up~0)| 0))) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1) (or .cse1 .cse2) (or .cse3 .cse4 .cse0 .cse5) (or .cse3 .cse4 .cse2 .cse5))) [2021-11-20 07:27:26,518 INFO L854 garLoopResultBuilder]: At program point update_channelsENTRY(lines 254 268) the Hoare annotation is: (let ((.cse0 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) .cse0 (not (= ~c_dr_st~0 0)) (not (= 1 ~c_dr_i~0))))) [2021-11-20 07:27:26,518 INFO L858 garLoopResultBuilder]: For program point update_channelsEXIT(lines 254 268) no Hoare annotation was computed. [2021-11-20 07:27:26,518 INFO L858 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2021-11-20 07:27:26,518 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2021-11-20 07:27:26,518 INFO L858 garLoopResultBuilder]: For program point L36-2(lines 35 50) no Hoare annotation was computed. [2021-11-20 07:27:26,519 INFO L858 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 325 342) no Hoare annotation was computed. [2021-11-20 07:27:26,519 INFO L858 garLoopResultBuilder]: For program point L334-1(lines 325 342) no Hoare annotation was computed. [2021-11-20 07:27:26,519 INFO L858 garLoopResultBuilder]: For program point L329-1(lines 328 341) no Hoare annotation was computed. [2021-11-20 07:27:26,519 INFO L854 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 325 342) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) .cse0 (not (= 1 ~c_dr_i~0))))) [2021-11-20 07:27:26,519 INFO L858 garLoopResultBuilder]: For program point L514-1(line 514) no Hoare annotation was computed. [2021-11-20 07:27:26,519 INFO L858 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2021-11-20 07:27:26,519 INFO L858 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2021-11-20 07:27:26,519 INFO L858 garLoopResultBuilder]: For program point L349(lines 349 356) no Hoare annotation was computed. [2021-11-20 07:27:26,519 INFO L854 garLoopResultBuilder]: At program point L349-2(lines 345 360) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,520 INFO L858 garLoopResultBuilder]: For program point L465(lines 465 470) no Hoare annotation was computed. [2021-11-20 07:27:26,520 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2021-11-20 07:27:26,520 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-20 07:27:26,520 INFO L858 garLoopResultBuilder]: For program point L218-1(lines 218 228) no Hoare annotation was computed. [2021-11-20 07:27:26,520 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2021-11-20 07:27:26,520 INFO L854 garLoopResultBuilder]: At program point L499(line 499) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,520 INFO L858 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2021-11-20 07:27:26,520 INFO L858 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2021-11-20 07:27:26,520 INFO L858 garLoopResultBuilder]: For program point L202(lines 202 206) no Hoare annotation was computed. [2021-11-20 07:27:26,520 INFO L854 garLoopResultBuilder]: At program point L153(lines 148 192) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 1))) (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) .cse0 (<= ~c_dr_pc~0 0)) (and (= ~c_dr_pc~0 1) .cse0))) [2021-11-20 07:27:26,521 INFO L854 garLoopResultBuilder]: At program point L203(lines 198 252) the Hoare annotation is: false [2021-11-20 07:27:26,521 INFO L854 garLoopResultBuilder]: At program point L484(line 484) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0)) [2021-11-20 07:27:26,521 INFO L858 garLoopResultBuilder]: For program point L484-1(line 484) no Hoare annotation was computed. [2021-11-20 07:27:26,521 INFO L854 garLoopResultBuilder]: At program point L451(lines 404 456) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,521 INFO L854 garLoopResultBuilder]: At program point L435(lines 410 450) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,521 INFO L854 garLoopResultBuilder]: At program point L171(lines 148 192) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,521 INFO L854 garLoopResultBuilder]: At program point L551(lines 535 553) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0)) [2021-11-20 07:27:26,521 INFO L854 garLoopResultBuilder]: At program point L188(lines 145 193) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,521 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2021-11-20 07:27:26,522 INFO L854 garLoopResultBuilder]: At program point L370-1(lines 361 378) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,522 INFO L854 garLoopResultBuilder]: At program point L486(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2021-11-20 07:27:26,522 INFO L854 garLoopResultBuilder]: At program point L486-1(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2021-11-20 07:27:26,522 INFO L858 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2021-11-20 07:27:26,522 INFO L854 garLoopResultBuilder]: At program point L503(line 503) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,522 INFO L854 garLoopResultBuilder]: At program point L503-1(line 503) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,522 INFO L854 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: false [2021-11-20 07:27:26,522 INFO L854 garLoopResultBuilder]: At program point L487(line 487) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2021-11-20 07:27:26,523 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-20 07:27:26,523 INFO L854 garLoopResultBuilder]: At program point L504(line 504) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,523 INFO L858 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2021-11-20 07:27:26,523 INFO L858 garLoopResultBuilder]: For program point L273-2(lines 272 285) no Hoare annotation was computed. [2021-11-20 07:27:26,523 INFO L854 garLoopResultBuilder]: At program point L505(line 505) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,523 INFO L854 garLoopResultBuilder]: At program point L472(lines 461 474) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,523 INFO L858 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2021-11-20 07:27:26,523 INFO L854 garLoopResultBuilder]: At program point L473(lines 457 475) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,523 INFO L858 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2021-11-20 07:27:26,523 INFO L858 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2021-11-20 07:27:26,524 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-20 07:27:26,524 INFO L854 garLoopResultBuilder]: At program point L491-1(lines 488 528) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,524 INFO L858 garLoopResultBuilder]: For program point L508(line 508) no Hoare annotation was computed. [2021-11-20 07:27:26,524 INFO L854 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: false [2021-11-20 07:27:26,524 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-20 07:27:26,524 INFO L861 garLoopResultBuilder]: At program point L244-1(lines 198 252) the Hoare annotation is: true [2021-11-20 07:27:26,524 INFO L858 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2021-11-20 07:27:26,524 INFO L854 garLoopResultBuilder]: At program point L278-1(lines 269 286) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2021-11-20 07:27:26,524 INFO L858 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2021-11-20 07:27:26,524 INFO L858 garLoopResultBuilder]: For program point L510-2(lines 510 519) no Hoare annotation was computed. [2021-11-20 07:27:26,525 INFO L854 garLoopResultBuilder]: At program point L411(line 411) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,525 INFO L854 garLoopResultBuilder]: At program point L164-1(lines 148 192) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 1))) (let ((.cse1 (= ~c_dr_st~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (= 1 ~c_dr_i~0)) (.cse0 (not .cse6)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0))) (or (and (= ~c_dr_pc~0 1) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse0 .cse4) (and .cse6 .cse5 (= ~c_dr_pc~0 ~q_req_up~0))))) [2021-11-20 07:27:26,525 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-20 07:27:26,525 INFO L858 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2021-11-20 07:27:26,525 INFO L858 garLoopResultBuilder]: For program point L413(line 413) no Hoare annotation was computed. [2021-11-20 07:27:26,525 INFO L854 garLoopResultBuilder]: At program point L248(lines 195 253) the Hoare annotation is: (= ~c_dr_pc~0 1) [2021-11-20 07:27:26,525 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 161) no Hoare annotation was computed. [2021-11-20 07:27:26,525 INFO L861 garLoopResultBuilder]: At program point L529(lines 476 534) the Hoare annotation is: true [2021-11-20 07:27:26,525 INFO L854 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,526 INFO L858 garLoopResultBuilder]: For program point L463-1(line 463) no Hoare annotation was computed. [2021-11-20 07:27:26,526 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2021-11-20 07:27:26,526 INFO L861 garLoopResultBuilder]: At program point L563(lines 554 565) the Hoare annotation is: true [2021-11-20 07:27:26,526 INFO L858 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2021-11-20 07:27:26,526 INFO L858 garLoopResultBuilder]: For program point L365-2(lines 364 377) no Hoare annotation was computed. [2021-11-20 07:27:26,526 INFO L854 garLoopResultBuilder]: At program point L514(line 514) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2021-11-20 07:27:26,526 INFO L858 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2021-11-20 07:27:26,526 INFO L854 garLoopResultBuilder]: At program point L87(lines 65 89) the Hoare annotation is: (let ((.cse2 (not (= ~q_read_ev~0 2))) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse0 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse1 (= ~p_dw_pc~0 1)) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 1)) .cse2) (or .cse3 .cse4 .cse0 .cse1 .cse2 .cse5) (or .cse3 (not (<= 2 ~fast_clk_edge~0)) .cse4 .cse0 (not .cse1) .cse5))) [2021-11-20 07:27:26,526 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 62 90) no Hoare annotation was computed. [2021-11-20 07:27:26,526 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 62 90) no Hoare annotation was computed. [2021-11-20 07:27:26,527 INFO L858 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2021-11-20 07:27:26,527 INFO L858 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2021-11-20 07:27:26,527 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 62 90) the Hoare annotation is: true [2021-11-20 07:27:26,527 INFO L858 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2021-11-20 07:27:26,527 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2021-11-20 07:27:26,527 INFO L858 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2021-11-20 07:27:26,527 INFO L858 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-20 07:27:26,527 INFO L861 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2021-11-20 07:27:26,527 INFO L858 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2021-11-20 07:27:26,531 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:27:26,532 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 07:27:26,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:27:26 BoogieIcfgContainer [2021-11-20 07:27:26,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 07:27:26,558 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 07:27:26,558 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 07:27:26,558 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 07:27:26,559 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:18" (3/4) ... [2021-11-20 07:27:26,562 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-20 07:27:26,568 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2021-11-20 07:27:26,568 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2021-11-20 07:27:26,568 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-11-20 07:27:26,568 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2021-11-20 07:27:26,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2021-11-20 07:27:26,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2021-11-20 07:27:26,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-11-20 07:27:26,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2021-11-20 07:27:26,579 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-11-20 07:27:26,579 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-20 07:27:26,580 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-20 07:27:26,581 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-20 07:27:26,605 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((q_req_up == 0 || !(c_dr_pc == 1)) && (!(c_dr_pc == 1) || !(\old(q_req_up) == 0))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || q_req_up == 0) || !(1 == c_dr_i))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || !(\old(q_req_up) == 0)) || !(1 == c_dr_i)) [2021-11-20 07:27:26,661 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 07:27:26,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 07:27:26,661 INFO L158 Benchmark]: Toolchain (without parser) took 68923.12ms. Allocated memory was 113.2MB in the beginning and 939.5MB in the end (delta: 826.3MB). Free memory was 72.7MB in the beginning and 718.0MB in the end (delta: -645.3MB). Peak memory consumption was 180.0MB. Max. memory is 16.1GB. [2021-11-20 07:27:26,662 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 113.2MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:27:26,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.30ms. Allocated memory is still 113.2MB. Free memory was 72.6MB in the beginning and 84.1MB in the end (delta: -11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-20 07:27:26,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.30ms. Allocated memory is still 113.2MB. Free memory was 84.1MB in the beginning and 82.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:27:26,663 INFO L158 Benchmark]: Boogie Preprocessor took 54.57ms. Allocated memory is still 113.2MB. Free memory was 82.4MB in the beginning and 80.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:27:26,664 INFO L158 Benchmark]: RCFGBuilder took 631.78ms. Allocated memory is still 113.2MB. Free memory was 80.6MB in the beginning and 64.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-11-20 07:27:26,664 INFO L158 Benchmark]: TraceAbstraction took 67695.69ms. Allocated memory was 113.2MB in the beginning and 939.5MB in the end (delta: 826.3MB). Free memory was 63.8MB in the beginning and 725.3MB in the end (delta: -661.6MB). Peak memory consumption was 595.5MB. Max. memory is 16.1GB. [2021-11-20 07:27:26,665 INFO L158 Benchmark]: Witness Printer took 102.89ms. Allocated memory is still 939.5MB. Free memory was 725.3MB in the beginning and 718.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-20 07:27:26,668 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 113.2MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.30ms. Allocated memory is still 113.2MB. Free memory was 72.6MB in the beginning and 84.1MB in the end (delta: -11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.30ms. Allocated memory is still 113.2MB. Free memory was 84.1MB in the beginning and 82.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.57ms. Allocated memory is still 113.2MB. Free memory was 82.4MB in the beginning and 80.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 631.78ms. Allocated memory is still 113.2MB. Free memory was 80.6MB in the beginning and 64.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 67695.69ms. Allocated memory was 113.2MB in the beginning and 939.5MB in the end (delta: 826.3MB). Free memory was 63.8MB in the beginning and 725.3MB in the end (delta: -661.6MB). Peak memory consumption was 595.5MB. Max. memory is 16.1GB. * Witness Printer took 102.89ms. Allocated memory is still 939.5MB. Free memory was 725.3MB in the beginning and 718.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.6s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 47.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6833 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6729 mSDsluCounter, 8191 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5666 mSDsCounter, 2003 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6268 IncrementalHoareTripleChecker+Invalid, 8271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2003 mSolverCounterUnsat, 2525 mSDtfsCounter, 6268 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1096 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7921occurred in iteration=12, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 1550 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 7671 PreInvPairs, 10405 NumberOfFragments, 1062 HoareAnnotationTreeSize, 7671 FomulaSimplifications, 10320 FormulaSimplificationTreeSizeReduction, 32.2s HoareSimplificationTime, 46 FomulaSimplificationsInter, 3267840 FormulaSimplificationTreeSizeReductionInter, 15.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1873 NumberOfCodeBlocks, 1873 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1857 ConstructedInterpolants, 0 QuantifiedInterpolants, 3640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1629 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 862/889 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((__retres1 <= 0 && 0 <= __retres1) || p_dw_pc == 1) || !(c_dr_pc == 1)) || !(q_read_ev == 2)) && (((((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || p_dw_pc == 1) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && (((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 1)) || !(1 == c_dr_i)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && p_dw_pc == 1) && c_dr_pc <= 0) || (c_dr_pc == 1 && p_dw_pc == 1) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(1 == c_dr_i) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((c_dr_pc == 1 && !(p_dw_pc == 1)) || ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) && q_req_up == p_dw_pc)) || ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && !(p_dw_pc == 1)) && c_dr_pc <= 0)) || ((p_dw_pc == 1 && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) || ((((((((c_dr_st == 0 && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((q_req_up == 0 || !(c_dr_pc == 1)) && (!(c_dr_pc == 1) || !(\old(q_req_up) == 0))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || q_req_up == 0) || !(1 == c_dr_i))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || !(\old(q_req_up) == 0)) || !(1 == c_dr_i)) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: ((((((((c_dr_st == 0 && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && p_dw_st == 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: c_dr_pc == 1 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 RESULT: Ultimate proved your program to be correct! [2021-11-20 07:27:26,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f673e09-5565-430f-919c-92aa72e589c6/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE