./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 16:17:48,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 16:17:48,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 16:17:49,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 16:17:49,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 16:17:49,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 16:17:49,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 16:17:49,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 16:17:49,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 16:17:49,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 16:17:49,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 16:17:49,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 16:17:49,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 16:17:49,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 16:17:49,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 16:17:49,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 16:17:49,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 16:17:49,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 16:17:49,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 16:17:49,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 16:17:49,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 16:17:49,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 16:17:49,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 16:17:49,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 16:17:49,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 16:17:49,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 16:17:49,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 16:17:49,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 16:17:49,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 16:17:49,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 16:17:49,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 16:17:49,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 16:17:49,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 16:17:49,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 16:17:49,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 16:17:49,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 16:17:49,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 16:17:49,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 16:17:49,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 16:17:49,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 16:17:49,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 16:17:49,046 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 16:17:49,079 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 16:17:49,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 16:17:49,080 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 16:17:49,081 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 16:17:49,082 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 16:17:49,082 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 16:17:49,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 16:17:49,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 16:17:49,083 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 16:17:49,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 16:17:49,084 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 16:17:49,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 16:17:49,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 16:17:49,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 16:17:49,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 16:17:49,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 16:17:49,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 16:17:49,086 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 16:17:49,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 16:17:49,086 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 16:17:49,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 16:17:49,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 16:17:49,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 16:17:49,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 16:17:49,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:17:49,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 16:17:49,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 16:17:49,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 16:17:49,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 16:17:49,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 16:17:49,089 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 16:17:49,089 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 16:17:49,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 16:17:49,089 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 16:17:49,090 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d [2021-12-14 16:17:49,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 16:17:49,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 16:17:49,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 16:17:49,347 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 16:17:49,347 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 16:17:49,348 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2021-12-14 16:17:49,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b379b8d9/c748a78ab85b4973aeb8105777b4a1a9/FLAG1bd508125 [2021-12-14 16:17:49,746 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 16:17:49,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2021-12-14 16:17:49,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b379b8d9/c748a78ab85b4973aeb8105777b4a1a9/FLAG1bd508125 [2021-12-14 16:17:50,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b379b8d9/c748a78ab85b4973aeb8105777b4a1a9 [2021-12-14 16:17:50,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 16:17:50,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 16:17:50,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 16:17:50,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 16:17:50,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 16:17:50,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:17:50" (1/1) ... [2021-12-14 16:17:50,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c850da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:17:50, skipping insertion in model container [2021-12-14 16:17:50,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:17:50" (1/1) ... [2021-12-14 16:17:50,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 16:17:50,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 16:17:50,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2021-12-14 16:17:50,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2021-12-14 16:17:50,436 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:17:50,443 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 16:17:50,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2021-12-14 16:17:50,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2021-12-14 16:17:50,482 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:17:50,496 INFO L208 MainTranslator]: Completed translation [2021-12-14 16:17:50,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:17:50 WrapperNode [2021-12-14 16:17:50,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 16:17:50,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 16:17:50,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 16:17:50,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 16:17:50,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:17:50" (1/1) ... [2021-12-14 16:17:50,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:17:50" (1/1) ... [2021-12-14 16:17:50,563 INFO L137 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 407 [2021-12-14 16:17:50,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 16:17:50,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 16:17:50,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 16:17:50,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 16:17:50,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:17:50" (1/1) ... [2021-12-14 16:17:50,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:17:50" (1/1) ... [2021-12-14 16:17:50,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:17:50" (1/1) ... [2021-12-14 16:17:50,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:17:50" (1/1) ... [2021-12-14 16:17:50,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:17:50" (1/1) ... [2021-12-14 16:17:50,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:17:50" (1/1) ... [2021-12-14 16:17:50,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:17:50" (1/1) ... [2021-12-14 16:17:50,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 16:17:50,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 16:17:50,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 16:17:50,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 16:17:50,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:17:50" (1/1) ... [2021-12-14 16:17:50,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:17:50,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:17:50,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 16:17:50,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 16:17:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 16:17:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-14 16:17:50,717 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-14 16:17:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-14 16:17:50,718 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-14 16:17:50,718 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-14 16:17:50,718 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-14 16:17:50,718 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-14 16:17:50,718 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-14 16:17:50,719 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-14 16:17:50,719 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-14 16:17:50,719 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-14 16:17:50,719 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-14 16:17:50,719 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-14 16:17:50,719 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-14 16:17:50,719 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-14 16:17:50,720 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-14 16:17:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-14 16:17:50,720 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-14 16:17:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-14 16:17:50,720 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-14 16:17:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-14 16:17:50,720 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-14 16:17:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 16:17:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-14 16:17:50,721 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-14 16:17:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-14 16:17:50,721 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-14 16:17:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 16:17:50,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 16:17:50,722 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-14 16:17:50,722 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-14 16:17:50,722 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2021-12-14 16:17:50,722 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2021-12-14 16:17:50,849 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 16:17:50,851 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 16:17:51,250 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 16:17:51,257 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 16:17:51,257 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-14 16:17:51,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:17:51 BoogieIcfgContainer [2021-12-14 16:17:51,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 16:17:51,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 16:17:51,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 16:17:51,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 16:17:51,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:17:50" (1/3) ... [2021-12-14 16:17:51,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad45017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:17:51, skipping insertion in model container [2021-12-14 16:17:51,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:17:50" (2/3) ... [2021-12-14 16:17:51,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad45017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:17:51, skipping insertion in model container [2021-12-14 16:17:51,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:17:51" (3/3) ... [2021-12-14 16:17:51,276 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2021-12-14 16:17:51,280 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 16:17:51,292 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 16:17:51,329 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 16:17:51,334 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-12-14 16:17:51,335 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-14 16:17:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-14 16:17:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 16:17:51,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:17:51,365 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] [2021-12-14 16:17:51,366 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:17:51,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:17:51,370 INFO L85 PathProgramCache]: Analyzing trace with hash 243262796, now seen corresponding path program 1 times [2021-12-14 16:17:51,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:17:51,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667388340] [2021-12-14 16:17:51,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:17:51,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:17:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:51,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:17:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:51,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:17:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:51,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:17:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:17:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:51,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:17:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:17:51,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:17:51,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667388340] [2021-12-14 16:17:51,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667388340] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:17:51,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:17:51,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:17:51,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126977579] [2021-12-14 16:17:51,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:17:51,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:17:51,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:17:51,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:17:51,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:17:51,713 INFO L87 Difference]: Start difference. First operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 16:17:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:17:52,463 INFO L93 Difference]: Finished difference Result 552 states and 832 transitions. [2021-12-14 16:17:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:17:52,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-14 16:17:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:17:52,477 INFO L225 Difference]: With dead ends: 552 [2021-12-14 16:17:52,477 INFO L226 Difference]: Without dead ends: 343 [2021-12-14 16:17:52,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:17:52,484 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 535 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 16:17:52,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 823 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 16:17:52,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-12-14 16:17:52,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 300. [2021-12-14 16:17:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 237 states have (on average 1.4556962025316456) internal successors, (345), 243 states have internal predecessors, (345), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2021-12-14 16:17:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2021-12-14 16:17:52,564 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 58 [2021-12-14 16:17:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:17:52,565 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2021-12-14 16:17:52,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 16:17:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2021-12-14 16:17:52,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 16:17:52,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:17:52,574 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] [2021-12-14 16:17:52,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 16:17:52,575 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:17:52,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:17:52,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2037521992, now seen corresponding path program 1 times [2021-12-14 16:17:52,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:17:52,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696239236] [2021-12-14 16:17:52,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:17:52,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:17:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:52,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:17:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:17:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:52,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:17:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:52,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:17:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:52,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:17:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:17:52,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:17:52,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696239236] [2021-12-14 16:17:52,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696239236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:17:52,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:17:52,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:17:52,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610772032] [2021-12-14 16:17:52,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:17:52,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:17:52,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:17:52,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:17:52,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:17:52,723 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 16:17:53,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:17:53,456 INFO L93 Difference]: Finished difference Result 651 states and 934 transitions. [2021-12-14 16:17:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:17:53,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-14 16:17:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:17:53,461 INFO L225 Difference]: With dead ends: 651 [2021-12-14 16:17:53,461 INFO L226 Difference]: Without dead ends: 456 [2021-12-14 16:17:53,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-14 16:17:53,464 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 527 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 16:17:53,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 946 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 16:17:53,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-12-14 16:17:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 390. [2021-12-14 16:17:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 310 states have (on average 1.4516129032258065) internal successors, (450), 317 states have internal predecessors, (450), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2021-12-14 16:17:53,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 553 transitions. [2021-12-14 16:17:53,497 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 553 transitions. Word has length 58 [2021-12-14 16:17:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:17:53,498 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 553 transitions. [2021-12-14 16:17:53,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 16:17:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 553 transitions. [2021-12-14 16:17:53,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 16:17:53,500 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:17:53,500 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] [2021-12-14 16:17:53,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 16:17:53,500 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:17:53,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:17:53,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1363958966, now seen corresponding path program 1 times [2021-12-14 16:17:53,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:17:53,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614624075] [2021-12-14 16:17:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:17:53,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:17:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:53,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:17:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:53,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:17:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:53,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:17:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:53,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:17:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:53,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:17:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:17:53,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:17:53,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614624075] [2021-12-14 16:17:53,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614624075] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:17:53,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:17:53,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:17:53,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403624897] [2021-12-14 16:17:53,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:17:53,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:17:53,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:17:53,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:17:53,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:17:53,584 INFO L87 Difference]: Start difference. First operand 390 states and 553 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 16:17:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:17:53,997 INFO L93 Difference]: Finished difference Result 737 states and 1061 transitions. [2021-12-14 16:17:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 16:17:53,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-14 16:17:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:17:54,000 INFO L225 Difference]: With dead ends: 737 [2021-12-14 16:17:54,000 INFO L226 Difference]: Without dead ends: 452 [2021-12-14 16:17:54,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:17:54,003 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 541 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 16:17:54,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [560 Valid, 619 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 16:17:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-12-14 16:17:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 390. [2021-12-14 16:17:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 310 states have (on average 1.4419354838709677) internal successors, (447), 317 states have internal predecessors, (447), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2021-12-14 16:17:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 550 transitions. [2021-12-14 16:17:54,031 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 550 transitions. Word has length 58 [2021-12-14 16:17:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:17:54,032 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 550 transitions. [2021-12-14 16:17:54,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 16:17:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 550 transitions. [2021-12-14 16:17:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 16:17:54,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:17:54,034 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] [2021-12-14 16:17:54,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 16:17:54,034 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:17:54,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:17:54,035 INFO L85 PathProgramCache]: Analyzing trace with hash 881620488, now seen corresponding path program 1 times [2021-12-14 16:17:54,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:17:54,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77484664] [2021-12-14 16:17:54,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:17:54,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:17:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:54,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:17:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:54,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:17:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:54,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:17:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:54,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:17:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:54,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:17:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:17:54,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:17:54,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77484664] [2021-12-14 16:17:54,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77484664] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:17:54,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:17:54,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:17:54,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50682681] [2021-12-14 16:17:54,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:17:54,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:17:54,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:17:54,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:17:54,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:17:54,139 INFO L87 Difference]: Start difference. First operand 390 states and 550 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 16:17:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:17:54,652 INFO L93 Difference]: Finished difference Result 773 states and 1118 transitions. [2021-12-14 16:17:54,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:17:54,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-14 16:17:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:17:54,655 INFO L225 Difference]: With dead ends: 773 [2021-12-14 16:17:54,655 INFO L226 Difference]: Without dead ends: 489 [2021-12-14 16:17:54,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-12-14 16:17:54,658 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 270 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 16:17:54,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 1086 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 16:17:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-12-14 16:17:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 399. [2021-12-14 16:17:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 319 states have (on average 1.4294670846394983) internal successors, (456), 326 states have internal predecessors, (456), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2021-12-14 16:17:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 559 transitions. [2021-12-14 16:17:54,683 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 559 transitions. Word has length 58 [2021-12-14 16:17:54,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:17:54,683 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 559 transitions. [2021-12-14 16:17:54,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 16:17:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 559 transitions. [2021-12-14 16:17:54,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 16:17:54,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:17:54,685 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] [2021-12-14 16:17:54,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 16:17:54,685 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:17:54,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:17:54,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1362362810, now seen corresponding path program 1 times [2021-12-14 16:17:54,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:17:54,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199939807] [2021-12-14 16:17:54,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:17:54,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:17:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:54,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:17:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:54,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:17:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:54,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:17:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:54,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:17:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:54,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:17:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:17:54,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:17:54,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199939807] [2021-12-14 16:17:54,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199939807] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:17:54,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:17:54,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:17:54,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046657233] [2021-12-14 16:17:54,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:17:54,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:17:54,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:17:54,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:17:54,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:17:54,805 INFO L87 Difference]: Start difference. First operand 399 states and 559 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 16:17:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:17:55,831 INFO L93 Difference]: Finished difference Result 1571 states and 2284 transitions. [2021-12-14 16:17:55,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 16:17:55,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-14 16:17:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:17:55,838 INFO L225 Difference]: With dead ends: 1571 [2021-12-14 16:17:55,838 INFO L226 Difference]: Without dead ends: 1278 [2021-12-14 16:17:55,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-12-14 16:17:55,840 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 1038 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 16:17:55,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1061 Valid, 1001 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-14 16:17:55,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2021-12-14 16:17:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1107. [2021-12-14 16:17:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 880 states have (on average 1.384090909090909) internal successors, (1218), 902 states have internal predecessors, (1218), 138 states have call successors, (138), 81 states have call predecessors, (138), 87 states have return successors, (187), 126 states have call predecessors, (187), 134 states have call successors, (187) [2021-12-14 16:17:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1543 transitions. [2021-12-14 16:17:55,907 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1543 transitions. Word has length 58 [2021-12-14 16:17:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:17:55,907 INFO L470 AbstractCegarLoop]: Abstraction has 1107 states and 1543 transitions. [2021-12-14 16:17:55,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 16:17:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1543 transitions. [2021-12-14 16:17:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 16:17:55,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:17:55,909 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-12-14 16:17:55,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 16:17:55,910 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:17:55,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:17:55,910 INFO L85 PathProgramCache]: Analyzing trace with hash -652739814, now seen corresponding path program 1 times [2021-12-14 16:17:55,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:17:55,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857693244] [2021-12-14 16:17:55,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:17:55,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:17:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:55,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:17:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:17:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:55,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:17:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:55,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:17:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:17:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:17:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:56,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:17:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:17:56,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:17:56,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857693244] [2021-12-14 16:17:56,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857693244] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:17:56,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:17:56,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:17:56,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915451858] [2021-12-14 16:17:56,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:17:56,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:17:56,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:17:56,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:17:56,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:17:56,012 INFO L87 Difference]: Start difference. First operand 1107 states and 1543 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-12-14 16:17:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:17:56,583 INFO L93 Difference]: Finished difference Result 1330 states and 1858 transitions. [2021-12-14 16:17:56,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:17:56,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2021-12-14 16:17:56,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:17:56,589 INFO L225 Difference]: With dead ends: 1330 [2021-12-14 16:17:56,591 INFO L226 Difference]: Without dead ends: 1242 [2021-12-14 16:17:56,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-14 16:17:56,594 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 531 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 16:17:56,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [536 Valid, 868 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 16:17:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2021-12-14 16:17:56,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1203. [2021-12-14 16:17:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 956 states have (on average 1.3838912133891212) internal successors, (1323), 980 states have internal predecessors, (1323), 149 states have call successors, (149), 88 states have call predecessors, (149), 96 states have return successors, (203), 138 states have call predecessors, (203), 145 states have call successors, (203) [2021-12-14 16:17:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1675 transitions. [2021-12-14 16:17:56,663 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1675 transitions. Word has length 65 [2021-12-14 16:17:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:17:56,668 INFO L470 AbstractCegarLoop]: Abstraction has 1203 states and 1675 transitions. [2021-12-14 16:17:56,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-12-14 16:17:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1675 transitions. [2021-12-14 16:17:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 16:17:56,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:17:56,671 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-12-14 16:17:56,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 16:17:56,671 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:17:56,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:17:56,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1026148826, now seen corresponding path program 1 times [2021-12-14 16:17:56,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:17:56,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496008693] [2021-12-14 16:17:56,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:17:56,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:17:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:56,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:17:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:56,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:17:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:56,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:17:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:56,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:17:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:56,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:17:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:56,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:17:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:56,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:17:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:17:56,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:17:56,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496008693] [2021-12-14 16:17:56,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496008693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:17:56,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:17:56,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:17:56,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081379653] [2021-12-14 16:17:56,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:17:56,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:17:56,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:17:56,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:17:56,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:17:56,797 INFO L87 Difference]: Start difference. First operand 1203 states and 1675 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-12-14 16:17:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:17:57,497 INFO L93 Difference]: Finished difference Result 1550 states and 2152 transitions. [2021-12-14 16:17:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 16:17:57,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2021-12-14 16:17:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:17:57,504 INFO L225 Difference]: With dead ends: 1550 [2021-12-14 16:17:57,504 INFO L226 Difference]: Without dead ends: 1373 [2021-12-14 16:17:57,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-14 16:17:57,508 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 678 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 16:17:57,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [698 Valid, 1141 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 16:17:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2021-12-14 16:17:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1299. [2021-12-14 16:17:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1032 states have (on average 1.3827519379844961) internal successors, (1427), 1058 states have internal predecessors, (1427), 160 states have call successors, (160), 95 states have call predecessors, (160), 105 states have return successors, (222), 150 states have call predecessors, (222), 156 states have call successors, (222) [2021-12-14 16:17:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1809 transitions. [2021-12-14 16:17:57,585 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1809 transitions. Word has length 65 [2021-12-14 16:17:57,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:17:57,585 INFO L470 AbstractCegarLoop]: Abstraction has 1299 states and 1809 transitions. [2021-12-14 16:17:57,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-12-14 16:17:57,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1809 transitions. [2021-12-14 16:17:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 16:17:57,586 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:17:57,587 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-12-14 16:17:57,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 16:17:57,587 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:17:57,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:17:57,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1002437284, now seen corresponding path program 1 times [2021-12-14 16:17:57,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:17:57,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737473501] [2021-12-14 16:17:57,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:17:57,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:17:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:57,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:17:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:57,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:17:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:57,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:17:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:57,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:17:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:57,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:17:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:57,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:17:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:57,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:17:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:17:57,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:17:57,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737473501] [2021-12-14 16:17:57,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737473501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:17:57,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:17:57,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:17:57,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490179736] [2021-12-14 16:17:57,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:17:57,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:17:57,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:17:57,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:17:57,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:17:57,718 INFO L87 Difference]: Start difference. First operand 1299 states and 1809 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-12-14 16:17:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:17:58,246 INFO L93 Difference]: Finished difference Result 1600 states and 2223 transitions. [2021-12-14 16:17:58,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:17:58,247 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-12-14 16:17:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:17:58,254 INFO L225 Difference]: With dead ends: 1600 [2021-12-14 16:17:58,254 INFO L226 Difference]: Without dead ends: 1333 [2021-12-14 16:17:58,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-14 16:17:58,256 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 210 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 16:17:58,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 1414 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 16:17:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2021-12-14 16:17:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1304. [2021-12-14 16:17:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1036 states have (on average 1.3793436293436294) internal successors, (1429), 1062 states have internal predecessors, (1429), 160 states have call successors, (160), 95 states have call predecessors, (160), 106 states have return successors, (223), 151 states have call predecessors, (223), 156 states have call successors, (223) [2021-12-14 16:17:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1812 transitions. [2021-12-14 16:17:58,319 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1812 transitions. Word has length 65 [2021-12-14 16:17:58,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:17:58,321 INFO L470 AbstractCegarLoop]: Abstraction has 1304 states and 1812 transitions. [2021-12-14 16:17:58,321 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-12-14 16:17:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1812 transitions. [2021-12-14 16:17:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 16:17:58,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:17:58,324 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-12-14 16:17:58,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 16:17:58,324 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:17:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:17:58,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2031796582, now seen corresponding path program 1 times [2021-12-14 16:17:58,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:17:58,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966898783] [2021-12-14 16:17:58,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:17:58,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:17:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:58,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:17:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:58,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:17:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:58,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:17:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:58,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:17:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:58,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:17:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:58,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:17:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:58,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:17:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:17:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:17:58,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:17:58,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966898783] [2021-12-14 16:17:58,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966898783] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:17:58,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:17:58,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:17:58,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838718447] [2021-12-14 16:17:58,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:17:58,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:17:58,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:17:58,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:17:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:17:58,480 INFO L87 Difference]: Start difference. First operand 1304 states and 1812 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-14 16:17:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:17:59,980 INFO L93 Difference]: Finished difference Result 2966 states and 4084 transitions. [2021-12-14 16:17:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-14 16:17:59,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2021-12-14 16:17:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:17:59,992 INFO L225 Difference]: With dead ends: 2966 [2021-12-14 16:17:59,992 INFO L226 Difference]: Without dead ends: 2694 [2021-12-14 16:17:59,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2021-12-14 16:17:59,996 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 1348 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-14 16:17:59,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1365 Valid, 1605 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-14 16:17:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2021-12-14 16:18:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2444. [2021-12-14 16:18:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 1936 states have (on average 1.3481404958677685) internal successors, (2610), 1982 states have internal predecessors, (2610), 277 states have call successors, (277), 197 states have call predecessors, (277), 229 states have return successors, (409), 269 states have call predecessors, (409), 273 states have call successors, (409) [2021-12-14 16:18:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3296 transitions. [2021-12-14 16:18:00,134 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3296 transitions. Word has length 65 [2021-12-14 16:18:00,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:00,134 INFO L470 AbstractCegarLoop]: Abstraction has 2444 states and 3296 transitions. [2021-12-14 16:18:00,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-14 16:18:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3296 transitions. [2021-12-14 16:18:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 16:18:00,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:00,137 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-12-14 16:18:00,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 16:18:00,137 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:00,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:00,138 INFO L85 PathProgramCache]: Analyzing trace with hash -980347493, now seen corresponding path program 1 times [2021-12-14 16:18:00,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:00,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534148723] [2021-12-14 16:18:00,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:00,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:00,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:00,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:18:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:00,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:18:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:00,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:18:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:00,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:18:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:00,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:18:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:00,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:18:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:18:00,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:00,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534148723] [2021-12-14 16:18:00,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534148723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:00,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:18:00,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:18:00,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838898259] [2021-12-14 16:18:00,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:00,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:18:00,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:00,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:18:00,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:18:00,245 INFO L87 Difference]: Start difference. First operand 2444 states and 3296 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-12-14 16:18:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:00,823 INFO L93 Difference]: Finished difference Result 4045 states and 5420 transitions. [2021-12-14 16:18:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 16:18:00,823 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-12-14 16:18:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:00,837 INFO L225 Difference]: With dead ends: 4045 [2021-12-14 16:18:00,837 INFO L226 Difference]: Without dead ends: 2633 [2021-12-14 16:18:00,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-14 16:18:00,841 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 208 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:00,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 1407 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 16:18:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2021-12-14 16:18:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2489. [2021-12-14 16:18:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 1972 states have (on average 1.3372210953346857) internal successors, (2637), 2018 states have internal predecessors, (2637), 277 states have call successors, (277), 197 states have call predecessors, (277), 238 states have return successors, (421), 278 states have call predecessors, (421), 273 states have call successors, (421) [2021-12-14 16:18:00,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3335 transitions. [2021-12-14 16:18:00,988 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3335 transitions. Word has length 65 [2021-12-14 16:18:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:00,988 INFO L470 AbstractCegarLoop]: Abstraction has 2489 states and 3335 transitions. [2021-12-14 16:18:00,988 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-12-14 16:18:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3335 transitions. [2021-12-14 16:18:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 16:18:00,990 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:00,991 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-12-14 16:18:00,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 16:18:00,991 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:00,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:00,992 INFO L85 PathProgramCache]: Analyzing trace with hash 405855901, now seen corresponding path program 1 times [2021-12-14 16:18:00,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:00,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246874758] [2021-12-14 16:18:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:00,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:01,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:01,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:18:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:01,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:18:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:01,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:18:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:01,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:18:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:01,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:18:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:01,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:18:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:18:01,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:01,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246874758] [2021-12-14 16:18:01,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246874758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:01,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:18:01,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:18:01,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171429066] [2021-12-14 16:18:01,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:01,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:18:01,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:01,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:18:01,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:18:01,078 INFO L87 Difference]: Start difference. First operand 2489 states and 3335 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-12-14 16:18:01,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:01,847 INFO L93 Difference]: Finished difference Result 3924 states and 5174 transitions. [2021-12-14 16:18:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 16:18:01,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2021-12-14 16:18:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:01,861 INFO L225 Difference]: With dead ends: 3924 [2021-12-14 16:18:01,861 INFO L226 Difference]: Without dead ends: 2687 [2021-12-14 16:18:01,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-14 16:18:01,865 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 568 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:01,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [586 Valid, 1032 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 16:18:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2021-12-14 16:18:01,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2467. [2021-12-14 16:18:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 1958 states have (on average 1.3345250255362615) internal successors, (2613), 1998 states have internal predecessors, (2613), 277 states have call successors, (277), 197 states have call predecessors, (277), 230 states have return successors, (405), 276 states have call predecessors, (405), 273 states have call successors, (405) [2021-12-14 16:18:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3295 transitions. [2021-12-14 16:18:01,993 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3295 transitions. Word has length 65 [2021-12-14 16:18:01,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:01,993 INFO L470 AbstractCegarLoop]: Abstraction has 2467 states and 3295 transitions. [2021-12-14 16:18:01,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-12-14 16:18:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3295 transitions. [2021-12-14 16:18:01,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 16:18:01,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:01,995 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-12-14 16:18:01,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 16:18:01,996 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:01,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:01,997 INFO L85 PathProgramCache]: Analyzing trace with hash 271842395, now seen corresponding path program 1 times [2021-12-14 16:18:01,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:01,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766457797] [2021-12-14 16:18:01,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:01,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:18:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:18:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:18:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:18:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:18:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:18:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:18:02,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:02,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766457797] [2021-12-14 16:18:02,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766457797] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:02,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:18:02,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:18:02,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016484308] [2021-12-14 16:18:02,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:02,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:18:02,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:02,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:18:02,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:18:02,087 INFO L87 Difference]: Start difference. First operand 2467 states and 3295 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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-12-14 16:18:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:02,536 INFO L93 Difference]: Finished difference Result 5542 states and 7274 transitions. [2021-12-14 16:18:02,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 16:18:02,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 65 [2021-12-14 16:18:02,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:02,554 INFO L225 Difference]: With dead ends: 5542 [2021-12-14 16:18:02,554 INFO L226 Difference]: Without dead ends: 4110 [2021-12-14 16:18:02,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-12-14 16:18:02,559 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 668 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:02,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 702 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 16:18:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states. [2021-12-14 16:18:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 3838. [2021-12-14 16:18:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3838 states, 3024 states have (on average 1.2996031746031746) internal successors, (3930), 3085 states have internal predecessors, (3930), 429 states have call successors, (429), 320 states have call predecessors, (429), 383 states have return successors, (677), 440 states have call predecessors, (677), 425 states have call successors, (677) [2021-12-14 16:18:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 5036 transitions. [2021-12-14 16:18:02,793 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 5036 transitions. Word has length 65 [2021-12-14 16:18:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:02,794 INFO L470 AbstractCegarLoop]: Abstraction has 3838 states and 5036 transitions. [2021-12-14 16:18:02,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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-12-14 16:18:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 5036 transitions. [2021-12-14 16:18:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 16:18:02,796 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:02,796 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, 1] [2021-12-14 16:18:02,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 16:18:02,797 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:02,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:02,797 INFO L85 PathProgramCache]: Analyzing trace with hash 520491120, now seen corresponding path program 1 times [2021-12-14 16:18:02,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:02,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538329419] [2021-12-14 16:18:02,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:02,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:18:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:18:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:18:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:18:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:18:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:18:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:18:02,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:02,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538329419] [2021-12-14 16:18:02,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538329419] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:02,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:18:02,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:18:02,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296051084] [2021-12-14 16:18:02,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:02,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:18:02,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:02,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:18:02,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:18:02,857 INFO L87 Difference]: Start difference. First operand 3838 states and 5036 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 16:18:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:03,412 INFO L93 Difference]: Finished difference Result 8856 states and 11550 transitions. [2021-12-14 16:18:03,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:18:03,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2021-12-14 16:18:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:03,435 INFO L225 Difference]: With dead ends: 8856 [2021-12-14 16:18:03,435 INFO L226 Difference]: Without dead ends: 6032 [2021-12-14 16:18:03,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:18:03,443 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 511 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:03,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [519 Valid, 711 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 16:18:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2021-12-14 16:18:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 5516. [2021-12-14 16:18:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5516 states, 4309 states have (on average 1.2833604084474357) internal successors, (5530), 4377 states have internal predecessors, (5530), 623 states have call successors, (623), 494 states have call predecessors, (623), 582 states have return successors, (998), 652 states have call predecessors, (998), 619 states have call successors, (998) [2021-12-14 16:18:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5516 states to 5516 states and 7151 transitions. [2021-12-14 16:18:03,755 INFO L78 Accepts]: Start accepts. Automaton has 5516 states and 7151 transitions. Word has length 66 [2021-12-14 16:18:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:03,756 INFO L470 AbstractCegarLoop]: Abstraction has 5516 states and 7151 transitions. [2021-12-14 16:18:03,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 16:18:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5516 states and 7151 transitions. [2021-12-14 16:18:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-14 16:18:03,760 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:03,760 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 16:18:03,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 16:18:03,760 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:03,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:03,761 INFO L85 PathProgramCache]: Analyzing trace with hash 708381945, now seen corresponding path program 1 times [2021-12-14 16:18:03,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:03,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819379511] [2021-12-14 16:18:03,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:03,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:03,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:03,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:18:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:03,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:18:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:03,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:18:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:03,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:18:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:18:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:03,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:18:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:18:03,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:03,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819379511] [2021-12-14 16:18:03,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819379511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:03,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:18:03,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:18:03,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059629737] [2021-12-14 16:18:03,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:03,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:18:03,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:03,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:18:03,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:18:03,827 INFO L87 Difference]: Start difference. First operand 5516 states and 7151 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-14 16:18:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:04,432 INFO L93 Difference]: Finished difference Result 7146 states and 9153 transitions. [2021-12-14 16:18:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:18:04,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2021-12-14 16:18:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:04,463 INFO L225 Difference]: With dead ends: 7146 [2021-12-14 16:18:04,463 INFO L226 Difference]: Without dead ends: 7143 [2021-12-14 16:18:04,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-12-14 16:18:04,468 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 941 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:04,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 587 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 16:18:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7143 states. [2021-12-14 16:18:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7143 to 6570. [2021-12-14 16:18:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6570 states, 5112 states have (on average 1.2715179968701096) internal successors, (6500), 5189 states have internal predecessors, (6500), 749 states have call successors, (749), 608 states have call predecessors, (749), 707 states have return successors, (1191), 780 states have call predecessors, (1191), 746 states have call successors, (1191) [2021-12-14 16:18:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6570 states to 6570 states and 8440 transitions. [2021-12-14 16:18:04,867 INFO L78 Accepts]: Start accepts. Automaton has 6570 states and 8440 transitions. Word has length 73 [2021-12-14 16:18:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:04,867 INFO L470 AbstractCegarLoop]: Abstraction has 6570 states and 8440 transitions. [2021-12-14 16:18:04,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-14 16:18:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 6570 states and 8440 transitions. [2021-12-14 16:18:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-14 16:18:04,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:04,870 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 16:18:04,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 16:18:04,870 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:04,871 INFO L85 PathProgramCache]: Analyzing trace with hash 484349401, now seen corresponding path program 1 times [2021-12-14 16:18:04,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:04,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198129319] [2021-12-14 16:18:04,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:04,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:04,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:04,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:18:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:04,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:18:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:04,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:18:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:04,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:18:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:04,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:18:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:04,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:18:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:18:04,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:04,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198129319] [2021-12-14 16:18:04,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198129319] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:18:04,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848110056] [2021-12-14 16:18:04,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:04,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:18:04,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:18:04,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 16:18:04,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 16:18:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:05,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 16:18:05,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:18:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:18:05,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 16:18:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:18:05,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848110056] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 16:18:05,779 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 16:18:05,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2021-12-14 16:18:05,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391767172] [2021-12-14 16:18:05,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 16:18:05,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 16:18:05,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:05,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 16:18:05,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:18:05,781 INFO L87 Difference]: Start difference. First operand 6570 states and 8440 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-14 16:18:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:07,367 INFO L93 Difference]: Finished difference Result 14216 states and 17968 transitions. [2021-12-14 16:18:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-14 16:18:07,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2021-12-14 16:18:07,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:07,418 INFO L225 Difference]: With dead ends: 14216 [2021-12-14 16:18:07,418 INFO L226 Difference]: Without dead ends: 14213 [2021-12-14 16:18:07,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2021-12-14 16:18:07,426 INFO L933 BasicCegarLoop]: 449 mSDtfsCounter, 1305 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:07,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1363 Valid, 1279 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-14 16:18:07,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14213 states. [2021-12-14 16:18:08,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14213 to 11828. [2021-12-14 16:18:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11828 states, 9204 states have (on average 1.2612994350282485) internal successors, (11609), 9333 states have internal predecessors, (11609), 1315 states have call successors, (1315), 1098 states have call predecessors, (1315), 1307 states have return successors, (2130), 1404 states have call predecessors, (2130), 1312 states have call successors, (2130) [2021-12-14 16:18:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11828 states to 11828 states and 15054 transitions. [2021-12-14 16:18:08,220 INFO L78 Accepts]: Start accepts. Automaton has 11828 states and 15054 transitions. Word has length 74 [2021-12-14 16:18:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:08,221 INFO L470 AbstractCegarLoop]: Abstraction has 11828 states and 15054 transitions. [2021-12-14 16:18:08,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-14 16:18:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 11828 states and 15054 transitions. [2021-12-14 16:18:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-14 16:18:08,224 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:08,224 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1] [2021-12-14 16:18:08,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 16:18:08,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 16:18:08,440 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:08,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:08,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1609727865, now seen corresponding path program 2 times [2021-12-14 16:18:08,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:08,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276066937] [2021-12-14 16:18:08,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:08,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:08,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:08,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:18:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:08,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:18:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:08,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:18:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:08,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:18:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:08,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:18:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:08,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:18:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:18:08,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:08,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276066937] [2021-12-14 16:18:08,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276066937] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:08,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:18:08,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:18:08,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529504512] [2021-12-14 16:18:08,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:08,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:18:08,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:08,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:18:08,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:18:08,498 INFO L87 Difference]: Start difference. First operand 11828 states and 15054 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-14 16:18:09,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:09,125 INFO L93 Difference]: Finished difference Result 18371 states and 23396 transitions. [2021-12-14 16:18:09,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 16:18:09,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2021-12-14 16:18:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:09,158 INFO L225 Difference]: With dead ends: 18371 [2021-12-14 16:18:09,159 INFO L226 Difference]: Without dead ends: 8433 [2021-12-14 16:18:09,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:18:09,185 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 538 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:09,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 691 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 16:18:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8433 states. [2021-12-14 16:18:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8433 to 7881. [2021-12-14 16:18:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7881 states, 6151 states have (on average 1.2435376361567225) internal successors, (7649), 6236 states have internal predecessors, (7649), 882 states have call successors, (882), 722 states have call predecessors, (882), 846 states have return successors, (1349), 930 states have call predecessors, (1349), 879 states have call successors, (1349) [2021-12-14 16:18:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7881 states to 7881 states and 9880 transitions. [2021-12-14 16:18:09,601 INFO L78 Accepts]: Start accepts. Automaton has 7881 states and 9880 transitions. Word has length 77 [2021-12-14 16:18:09,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:09,602 INFO L470 AbstractCegarLoop]: Abstraction has 7881 states and 9880 transitions. [2021-12-14 16:18:09,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-14 16:18:09,602 INFO L276 IsEmpty]: Start isEmpty. Operand 7881 states and 9880 transitions. [2021-12-14 16:18:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-14 16:18:09,606 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:09,606 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 16:18:09,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 16:18:09,606 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1048076277, now seen corresponding path program 1 times [2021-12-14 16:18:09,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:09,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794320422] [2021-12-14 16:18:09,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:09,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:09,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:09,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:18:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:09,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:18:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:09,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:18:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:09,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:18:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:09,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:18:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:09,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:18:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:09,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 16:18:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 16:18:09,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:09,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794320422] [2021-12-14 16:18:09,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794320422] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:09,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:18:09,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:18:09,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421531817] [2021-12-14 16:18:09,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:09,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:18:09,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:09,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:18:09,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:18:09,680 INFO L87 Difference]: Start difference. First operand 7881 states and 9880 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 16:18:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:11,176 INFO L93 Difference]: Finished difference Result 21755 states and 27097 transitions. [2021-12-14 16:18:11,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 16:18:11,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2021-12-14 16:18:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:11,233 INFO L225 Difference]: With dead ends: 21755 [2021-12-14 16:18:11,234 INFO L226 Difference]: Without dead ends: 14912 [2021-12-14 16:18:11,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-12-14 16:18:11,260 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 762 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:11,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [778 Valid, 971 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 16:18:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14912 states. [2021-12-14 16:18:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14912 to 14053. [2021-12-14 16:18:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14053 states, 10827 states have (on average 1.2132631384501709) internal successors, (13136), 11018 states have internal predecessors, (13136), 1598 states have call successors, (1598), 1326 states have call predecessors, (1598), 1626 states have return successors, (2752), 1722 states have call predecessors, (2752), 1595 states have call successors, (2752) [2021-12-14 16:18:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14053 states to 14053 states and 17486 transitions. [2021-12-14 16:18:11,969 INFO L78 Accepts]: Start accepts. Automaton has 14053 states and 17486 transitions. Word has length 84 [2021-12-14 16:18:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:11,970 INFO L470 AbstractCegarLoop]: Abstraction has 14053 states and 17486 transitions. [2021-12-14 16:18:11,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 16:18:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 14053 states and 17486 transitions. [2021-12-14 16:18:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-14 16:18:11,977 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:11,977 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 16:18:11,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 16:18:11,978 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:11,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:11,978 INFO L85 PathProgramCache]: Analyzing trace with hash -559065813, now seen corresponding path program 1 times [2021-12-14 16:18:11,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:11,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26984517] [2021-12-14 16:18:11,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:11,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:11,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:18:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:12,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:18:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:12,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:18:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:12,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:18:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:12,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-14 16:18:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:12,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:12,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 16:18:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-14 16:18:12,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:12,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26984517] [2021-12-14 16:18:12,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26984517] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:18:12,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812290303] [2021-12-14 16:18:12,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:12,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:18:12,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:18:12,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 16:18:12,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 16:18:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:12,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:18:12,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:18:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 16:18:12,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:18:12,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812290303] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:12,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:18:12,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:18:12,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360381297] [2021-12-14 16:18:12,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:12,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:18:12,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:12,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:18:12,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:18:12,271 INFO L87 Difference]: Start difference. First operand 14053 states and 17486 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 16:18:12,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:12,921 INFO L93 Difference]: Finished difference Result 15946 states and 20145 transitions. [2021-12-14 16:18:12,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:18:12,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2021-12-14 16:18:12,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:12,971 INFO L225 Difference]: With dead ends: 15946 [2021-12-14 16:18:12,971 INFO L226 Difference]: Without dead ends: 14299 [2021-12-14 16:18:12,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:18:12,985 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 113 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:12,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 648 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:18:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14299 states. [2021-12-14 16:18:13,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14299 to 14299. [2021-12-14 16:18:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14299 states, 11025 states have (on average 1.215419501133787) internal successors, (13400), 11218 states have internal predecessors, (13400), 1626 states have call successors, (1626), 1344 states have call predecessors, (1626), 1646 states have return successors, (2794), 1750 states have call predecessors, (2794), 1623 states have call successors, (2794) [2021-12-14 16:18:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14299 states to 14299 states and 17820 transitions. [2021-12-14 16:18:13,712 INFO L78 Accepts]: Start accepts. Automaton has 14299 states and 17820 transitions. Word has length 93 [2021-12-14 16:18:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:13,713 INFO L470 AbstractCegarLoop]: Abstraction has 14299 states and 17820 transitions. [2021-12-14 16:18:13,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 16:18:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 14299 states and 17820 transitions. [2021-12-14 16:18:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-14 16:18:13,721 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:13,721 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-12-14 16:18:13,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 16:18:13,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 16:18:13,936 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:13,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2008597495, now seen corresponding path program 1 times [2021-12-14 16:18:13,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:13,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426863206] [2021-12-14 16:18:13,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:13,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:13,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:13,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:18:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:13,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:18:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:13,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:18:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:14,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:18:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:14,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:18:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:14,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:18:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:14,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 16:18:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 16:18:14,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:14,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426863206] [2021-12-14 16:18:14,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426863206] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:14,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:18:14,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:18:14,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632753349] [2021-12-14 16:18:14,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:14,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:18:14,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:14,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:18:14,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:18:14,017 INFO L87 Difference]: Start difference. First operand 14299 states and 17820 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 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-12-14 16:18:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:15,525 INFO L93 Difference]: Finished difference Result 25173 states and 31139 transitions. [2021-12-14 16:18:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 16:18:15,525 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 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 93 [2021-12-14 16:18:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:15,561 INFO L225 Difference]: With dead ends: 25173 [2021-12-14 16:18:15,561 INFO L226 Difference]: Without dead ends: 12774 [2021-12-14 16:18:15,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-12-14 16:18:15,586 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 1337 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:15,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1372 Valid, 1140 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-14 16:18:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12774 states. [2021-12-14 16:18:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12774 to 11874. [2021-12-14 16:18:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11874 states, 9191 states have (on average 1.2089000108802088) internal successors, (11111), 9351 states have internal predecessors, (11111), 1327 states have call successors, (1327), 1093 states have call predecessors, (1327), 1354 states have return successors, (2126), 1440 states have call predecessors, (2126), 1324 states have call successors, (2126) [2021-12-14 16:18:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11874 states to 11874 states and 14564 transitions. [2021-12-14 16:18:16,341 INFO L78 Accepts]: Start accepts. Automaton has 11874 states and 14564 transitions. Word has length 93 [2021-12-14 16:18:16,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:16,342 INFO L470 AbstractCegarLoop]: Abstraction has 11874 states and 14564 transitions. [2021-12-14 16:18:16,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 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-12-14 16:18:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 11874 states and 14564 transitions. [2021-12-14 16:18:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-14 16:18:16,351 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:16,352 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 16:18:16,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 16:18:16,352 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:16,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1056840823, now seen corresponding path program 1 times [2021-12-14 16:18:16,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:16,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985961510] [2021-12-14 16:18:16,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:16,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:16,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:16,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:18:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:16,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:18:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:16,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:18:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:16,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:18:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:16,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-14 16:18:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:16,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:16,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-14 16:18:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:16,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:16,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-14 16:18:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-14 16:18:16,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:16,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985961510] [2021-12-14 16:18:16,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985961510] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:18:16,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038120801] [2021-12-14 16:18:16,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:16,438 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:18:16,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:18:16,439 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 16:18:16,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 16:18:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:16,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:18:16,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:18:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 16:18:16,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:18:16,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038120801] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:16,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:18:16,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-14 16:18:16,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729812087] [2021-12-14 16:18:16,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:16,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:18:16,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:16,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:18:16,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:18:16,734 INFO L87 Difference]: Start difference. First operand 11874 states and 14564 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-14 16:18:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:17,334 INFO L93 Difference]: Finished difference Result 13625 states and 17039 transitions. [2021-12-14 16:18:17,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:18:17,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2021-12-14 16:18:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:17,366 INFO L225 Difference]: With dead ends: 13625 [2021-12-14 16:18:17,366 INFO L226 Difference]: Without dead ends: 12610 [2021-12-14 16:18:17,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:18:17,375 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 208 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:17,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 441 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:18:17,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12610 states. [2021-12-14 16:18:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12610 to 12582. [2021-12-14 16:18:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12582 states, 9764 states have (on average 1.218455551003687) internal successors, (11897), 9933 states have internal predecessors, (11897), 1405 states have call successors, (1405), 1144 states have call predecessors, (1405), 1411 states have return successors, (2230), 1515 states have call predecessors, (2230), 1402 states have call successors, (2230) [2021-12-14 16:18:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12582 states to 12582 states and 15532 transitions. [2021-12-14 16:18:17,968 INFO L78 Accepts]: Start accepts. Automaton has 12582 states and 15532 transitions. Word has length 119 [2021-12-14 16:18:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:17,969 INFO L470 AbstractCegarLoop]: Abstraction has 12582 states and 15532 transitions. [2021-12-14 16:18:17,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-14 16:18:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 12582 states and 15532 transitions. [2021-12-14 16:18:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-14 16:18:17,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:17,981 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 16:18:18,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 16:18:18,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:18:18,196 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:18,196 INFO L85 PathProgramCache]: Analyzing trace with hash 131680678, now seen corresponding path program 1 times [2021-12-14 16:18:18,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:18,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336154775] [2021-12-14 16:18:18,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:18,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:18,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:18,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:18:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:18,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:18:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:18,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:18:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:18,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:18:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:18,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 16:18:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:18,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 16:18:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:18,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:18,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 16:18:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:18,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:18,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 16:18:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-14 16:18:18,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:18,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336154775] [2021-12-14 16:18:18,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336154775] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:18:18,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962015211] [2021-12-14 16:18:18,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:18,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:18:18,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:18:18,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 16:18:18,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 16:18:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:18,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:18:18,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:18:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-14 16:18:18,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:18:18,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962015211] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:18,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:18:18,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:18:18,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377157879] [2021-12-14 16:18:18,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:18,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:18:18,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:18,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:18:18,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:18:18,550 INFO L87 Difference]: Start difference. First operand 12582 states and 15532 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 16:18:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:19,062 INFO L93 Difference]: Finished difference Result 14844 states and 18704 transitions. [2021-12-14 16:18:19,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:18:19,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2021-12-14 16:18:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:19,101 INFO L225 Difference]: With dead ends: 14844 [2021-12-14 16:18:19,102 INFO L226 Difference]: Without dead ends: 12888 [2021-12-14 16:18:19,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:18:19,117 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 259 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:19,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 306 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:18:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12888 states. [2021-12-14 16:18:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12888 to 12822. [2021-12-14 16:18:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12822 states, 9983 states have (on average 1.208955223880597) internal successors, (12069), 10149 states have internal predecessors, (12069), 1405 states have call successors, (1405), 1162 states have call predecessors, (1405), 1432 states have return successors, (2224), 1521 states have call predecessors, (2224), 1402 states have call successors, (2224) [2021-12-14 16:18:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12822 states to 12822 states and 15698 transitions. [2021-12-14 16:18:19,838 INFO L78 Accepts]: Start accepts. Automaton has 12822 states and 15698 transitions. Word has length 135 [2021-12-14 16:18:19,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:19,838 INFO L470 AbstractCegarLoop]: Abstraction has 12822 states and 15698 transitions. [2021-12-14 16:18:19,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 16:18:19,839 INFO L276 IsEmpty]: Start isEmpty. Operand 12822 states and 15698 transitions. [2021-12-14 16:18:19,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-14 16:18:19,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:19,849 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 16:18:19,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-14 16:18:20,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:18:20,063 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:20,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:20,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1548570021, now seen corresponding path program 1 times [2021-12-14 16:18:20,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:20,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243610790] [2021-12-14 16:18:20,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:20,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:20,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:18:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:20,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:18:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:20,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:18:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:20,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:18:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:20,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 16:18:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 16:18:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:20,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:20,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 16:18:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:20,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:20,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 16:18:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-14 16:18:20,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:20,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243610790] [2021-12-14 16:18:20,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243610790] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:18:20,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47216966] [2021-12-14 16:18:20,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:20,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:18:20,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:18:20,163 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 16:18:20,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 16:18:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:20,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 16:18:20,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:18:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-14 16:18:20,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:18:20,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47216966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:20,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:18:20,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:18:20,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051159184] [2021-12-14 16:18:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:20,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:18:20,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:20,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:18:20,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:18:20,462 INFO L87 Difference]: Start difference. First operand 12822 states and 15698 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-14 16:18:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:20,903 INFO L93 Difference]: Finished difference Result 15067 states and 18659 transitions. [2021-12-14 16:18:20,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:18:20,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 135 [2021-12-14 16:18:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:20,938 INFO L225 Difference]: With dead ends: 15067 [2021-12-14 16:18:20,938 INFO L226 Difference]: Without dead ends: 12873 [2021-12-14 16:18:20,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:18:20,948 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 247 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:20,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 429 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:18:20,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12873 states. [2021-12-14 16:18:21,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12873 to 12804. [2021-12-14 16:18:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12804 states, 9965 states have (on average 1.2039136979427998) internal successors, (11997), 10131 states have internal predecessors, (11997), 1405 states have call successors, (1405), 1162 states have call predecessors, (1405), 1432 states have return successors, (2224), 1521 states have call predecessors, (2224), 1402 states have call successors, (2224) [2021-12-14 16:18:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12804 states to 12804 states and 15626 transitions. [2021-12-14 16:18:21,530 INFO L78 Accepts]: Start accepts. Automaton has 12804 states and 15626 transitions. Word has length 135 [2021-12-14 16:18:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:21,530 INFO L470 AbstractCegarLoop]: Abstraction has 12804 states and 15626 transitions. [2021-12-14 16:18:21,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-14 16:18:21,530 INFO L276 IsEmpty]: Start isEmpty. Operand 12804 states and 15626 transitions. [2021-12-14 16:18:21,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-14 16:18:21,538 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:21,539 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 16:18:21,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 16:18:21,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-14 16:18:21,739 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:21,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:21,740 INFO L85 PathProgramCache]: Analyzing trace with hash 367339351, now seen corresponding path program 1 times [2021-12-14 16:18:21,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:21,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078004755] [2021-12-14 16:18:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:21,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:21,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:21,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:18:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:21,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:18:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:21,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:18:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:21,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:18:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:21,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 16:18:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:21,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:18:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:21,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:21,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 16:18:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:21,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:21,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 16:18:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-14 16:18:21,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:21,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078004755] [2021-12-14 16:18:21,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078004755] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:18:21,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006611676] [2021-12-14 16:18:21,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:21,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:18:21,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:18:21,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 16:18:21,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 16:18:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:21,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 16:18:21,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:18:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 16:18:22,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:18:22,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006611676] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:22,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:18:22,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:18:22,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827040330] [2021-12-14 16:18:22,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:22,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:18:22,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:22,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:18:22,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:18:22,102 INFO L87 Difference]: Start difference. First operand 12804 states and 15626 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 16:18:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:22,554 INFO L93 Difference]: Finished difference Result 13748 states and 16914 transitions. [2021-12-14 16:18:22,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:18:22,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2021-12-14 16:18:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:22,577 INFO L225 Difference]: With dead ends: 13748 [2021-12-14 16:18:22,577 INFO L226 Difference]: Without dead ends: 12640 [2021-12-14 16:18:22,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:18:22,582 INFO L933 BasicCegarLoop]: 381 mSDtfsCounter, 87 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:22,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 647 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:18:22,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12640 states. [2021-12-14 16:18:23,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12640 to 12600. [2021-12-14 16:18:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12600 states, 9803 states have (on average 1.199632765479955) internal successors, (11760), 9967 states have internal predecessors, (11760), 1383 states have call successors, (1383), 1147 states have call predecessors, (1383), 1412 states have return successors, (2184), 1496 states have call predecessors, (2184), 1380 states have call successors, (2184) [2021-12-14 16:18:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12600 states to 12600 states and 15327 transitions. [2021-12-14 16:18:23,111 INFO L78 Accepts]: Start accepts. Automaton has 12600 states and 15327 transitions. Word has length 136 [2021-12-14 16:18:23,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:23,111 INFO L470 AbstractCegarLoop]: Abstraction has 12600 states and 15327 transitions. [2021-12-14 16:18:23,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 16:18:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 12600 states and 15327 transitions. [2021-12-14 16:18:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-14 16:18:23,119 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:23,119 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 16:18:23,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-14 16:18:23,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:18:23,320 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:23,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:23,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2008230337, now seen corresponding path program 1 times [2021-12-14 16:18:23,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:23,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233694624] [2021-12-14 16:18:23,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:23,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:23,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:23,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:18:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:23,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:18:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:23,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:18:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:23,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:18:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:23,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 16:18:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:23,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:18:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:23,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:23,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 16:18:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:23,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:23,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 16:18:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-14 16:18:23,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:23,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233694624] [2021-12-14 16:18:23,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233694624] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:18:23,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802017251] [2021-12-14 16:18:23,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:23,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:18:23,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:18:23,404 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 16:18:23,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 16:18:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:23,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 16:18:23,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:18:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-14 16:18:23,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:18:23,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802017251] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:23,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:18:23,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-14 16:18:23,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226854095] [2021-12-14 16:18:23,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:23,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:18:23,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:23,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:18:23,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:18:23,705 INFO L87 Difference]: Start difference. First operand 12600 states and 15327 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 16:18:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:24,468 INFO L93 Difference]: Finished difference Result 14185 states and 17330 transitions. [2021-12-14 16:18:24,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 16:18:24,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-14 16:18:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:24,502 INFO L225 Difference]: With dead ends: 14185 [2021-12-14 16:18:24,502 INFO L226 Difference]: Without dead ends: 12213 [2021-12-14 16:18:24,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-14 16:18:24,512 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 339 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:24,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 525 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 16:18:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2021-12-14 16:18:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 12180. [2021-12-14 16:18:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12180 states, 9470 states have (on average 1.1893347412882789) internal successors, (11263), 9627 states have internal predecessors, (11263), 1327 states have call successors, (1327), 1114 states have call predecessors, (1327), 1381 states have return successors, (2108), 1449 states have call predecessors, (2108), 1324 states have call successors, (2108) [2021-12-14 16:18:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12180 states to 12180 states and 14698 transitions. [2021-12-14 16:18:25,219 INFO L78 Accepts]: Start accepts. Automaton has 12180 states and 14698 transitions. Word has length 137 [2021-12-14 16:18:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:25,219 INFO L470 AbstractCegarLoop]: Abstraction has 12180 states and 14698 transitions. [2021-12-14 16:18:25,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 16:18:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 12180 states and 14698 transitions. [2021-12-14 16:18:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-14 16:18:25,227 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:25,227 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 16:18:25,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-14 16:18:25,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:18:25,428 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:25,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:25,429 INFO L85 PathProgramCache]: Analyzing trace with hash 979594561, now seen corresponding path program 1 times [2021-12-14 16:18:25,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:25,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486855649] [2021-12-14 16:18:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:25,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:25,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:25,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:18:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:25,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:18:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:25,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:18:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:25,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:18:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:25,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 16:18:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:25,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:18:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:25,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:25,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 16:18:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:25,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:25,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 16:18:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-14 16:18:25,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:25,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486855649] [2021-12-14 16:18:25,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486855649] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:18:25,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90326417] [2021-12-14 16:18:25,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:25,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:18:25,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:18:25,516 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 16:18:25,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 16:18:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:25,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 16:18:25,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:18:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-14 16:18:25,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:18:25,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90326417] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:25,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:18:25,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 16:18:25,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927812502] [2021-12-14 16:18:25,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:25,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:18:25,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:25,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:18:25,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:18:25,822 INFO L87 Difference]: Start difference. First operand 12180 states and 14698 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 16:18:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:26,519 INFO L93 Difference]: Finished difference Result 13775 states and 16702 transitions. [2021-12-14 16:18:26,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 16:18:26,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-14 16:18:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:26,554 INFO L225 Difference]: With dead ends: 13775 [2021-12-14 16:18:26,554 INFO L226 Difference]: Without dead ends: 12222 [2021-12-14 16:18:26,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:18:26,563 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 10 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:26,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1103 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:18:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12222 states. [2021-12-14 16:18:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12222 to 12198. [2021-12-14 16:18:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12198 states, 9488 states have (on average 1.1858136593591906) internal successors, (11251), 9645 states have internal predecessors, (11251), 1327 states have call successors, (1327), 1114 states have call predecessors, (1327), 1381 states have return successors, (2108), 1449 states have call predecessors, (2108), 1324 states have call successors, (2108) [2021-12-14 16:18:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12198 states to 12198 states and 14686 transitions. [2021-12-14 16:18:27,071 INFO L78 Accepts]: Start accepts. Automaton has 12198 states and 14686 transitions. Word has length 137 [2021-12-14 16:18:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:27,072 INFO L470 AbstractCegarLoop]: Abstraction has 12198 states and 14686 transitions. [2021-12-14 16:18:27,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 16:18:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 12198 states and 14686 transitions. [2021-12-14 16:18:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-14 16:18:27,079 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:27,080 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 16:18:27,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 16:18:27,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-14 16:18:27,280 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:27,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:27,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1021717307, now seen corresponding path program 1 times [2021-12-14 16:18:27,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:27,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286768326] [2021-12-14 16:18:27,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:27,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:27,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:27,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:18:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:27,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:18:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:27,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:18:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:27,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:18:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:27,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 16:18:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:27,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:18:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:27,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:27,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 16:18:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:27,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:27,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 16:18:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-14 16:18:27,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:27,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286768326] [2021-12-14 16:18:27,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286768326] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:27,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:18:27,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:18:27,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291055028] [2021-12-14 16:18:27,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:27,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:18:27,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:27,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:18:27,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:18:27,374 INFO L87 Difference]: Start difference. First operand 12198 states and 14686 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-14 16:18:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:28,299 INFO L93 Difference]: Finished difference Result 13695 states and 16415 transitions. [2021-12-14 16:18:28,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:18:28,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2021-12-14 16:18:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:28,325 INFO L225 Difference]: With dead ends: 13695 [2021-12-14 16:18:28,325 INFO L226 Difference]: Without dead ends: 13692 [2021-12-14 16:18:28,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-14 16:18:28,332 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 718 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:28,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [751 Valid, 836 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 16:18:28,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13692 states. [2021-12-14 16:18:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13692 to 13236. [2021-12-14 16:18:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13236 states, 10340 states have (on average 1.1831721470019343) internal successors, (12234), 10508 states have internal predecessors, (12234), 1427 states have call successors, (1427), 1186 states have call predecessors, (1427), 1467 states have return successors, (2234), 1552 states have call predecessors, (2234), 1424 states have call successors, (2234) [2021-12-14 16:18:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13236 states to 13236 states and 15895 transitions. [2021-12-14 16:18:28,927 INFO L78 Accepts]: Start accepts. Automaton has 13236 states and 15895 transitions. Word has length 137 [2021-12-14 16:18:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:28,927 INFO L470 AbstractCegarLoop]: Abstraction has 13236 states and 15895 transitions. [2021-12-14 16:18:28,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-14 16:18:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 13236 states and 15895 transitions. [2021-12-14 16:18:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-14 16:18:28,936 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:28,937 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 16:18:28,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-14 16:18:28,937 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:28,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1303301901, now seen corresponding path program 1 times [2021-12-14 16:18:28,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:28,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023226994] [2021-12-14 16:18:28,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:28,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:28,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:28,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:18:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:28,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:18:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:18:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:18:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:18:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:18:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 16:18:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:18:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 16:18:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-14 16:18:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:18:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:18:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 16:18:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-14 16:18:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-14 16:18:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-14 16:18:29,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:29,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023226994] [2021-12-14 16:18:29,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023226994] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:18:29,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959266731] [2021-12-14 16:18:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:29,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:18:29,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:18:29,044 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 16:18:29,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 16:18:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:29,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 16:18:29,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:18:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 16:18:29,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:18:29,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959266731] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:29,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:18:29,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2021-12-14 16:18:29,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758157587] [2021-12-14 16:18:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:29,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:18:29,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:29,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:18:29,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-14 16:18:29,376 INFO L87 Difference]: Start difference. First operand 13236 states and 15895 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-14 16:18:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:29,727 INFO L93 Difference]: Finished difference Result 18384 states and 22115 transitions. [2021-12-14 16:18:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 16:18:29,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2021-12-14 16:18:29,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:29,744 INFO L225 Difference]: With dead ends: 18384 [2021-12-14 16:18:29,744 INFO L226 Difference]: Without dead ends: 7802 [2021-12-14 16:18:29,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-14 16:18:29,757 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 34 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:29,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1358 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:18:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7802 states. [2021-12-14 16:18:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7802 to 7360. [2021-12-14 16:18:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7360 states, 5905 states have (on average 1.168501270110076) internal successors, (6900), 5971 states have internal predecessors, (6900), 729 states have call successors, (729), 580 states have call predecessors, (729), 724 states have return successors, (1074), 810 states have call predecessors, (1074), 726 states have call successors, (1074) [2021-12-14 16:18:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7360 states to 7360 states and 8703 transitions. [2021-12-14 16:18:30,069 INFO L78 Accepts]: Start accepts. Automaton has 7360 states and 8703 transitions. Word has length 145 [2021-12-14 16:18:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:30,069 INFO L470 AbstractCegarLoop]: Abstraction has 7360 states and 8703 transitions. [2021-12-14 16:18:30,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-14 16:18:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7360 states and 8703 transitions. [2021-12-14 16:18:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-14 16:18:30,076 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:30,076 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 16:18:30,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 16:18:30,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-14 16:18:30,277 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:30,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:30,277 INFO L85 PathProgramCache]: Analyzing trace with hash -72735443, now seen corresponding path program 1 times [2021-12-14 16:18:30,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:30,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794049601] [2021-12-14 16:18:30,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:30,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:30,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:18:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:30,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:18:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:30,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:18:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:30,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:18:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:30,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:18:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:30,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 16:18:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:30,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:18:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:30,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:30,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 16:18:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:30,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:18:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:30,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 16:18:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:18:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-14 16:18:30,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:18:30,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794049601] [2021-12-14 16:18:30,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794049601] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:18:30,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:18:30,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 16:18:30,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810694406] [2021-12-14 16:18:30,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:18:30,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:18:30,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:18:30,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:18:30,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 16:18:30,342 INFO L87 Difference]: Start difference. First operand 7360 states and 8703 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 16:18:30,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:18:30,861 INFO L93 Difference]: Finished difference Result 9977 states and 12004 transitions. [2021-12-14 16:18:30,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 16:18:30,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2021-12-14 16:18:30,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:18:30,877 INFO L225 Difference]: With dead ends: 9977 [2021-12-14 16:18:30,877 INFO L226 Difference]: Without dead ends: 8149 [2021-12-14 16:18:30,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:18:30,881 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 247 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 16:18:30,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 806 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 16:18:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8149 states. [2021-12-14 16:18:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8149 to 7363. [2021-12-14 16:18:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7363 states, 5908 states have (on average 1.1684157075152335) internal successors, (6903), 5974 states have internal predecessors, (6903), 729 states have call successors, (729), 580 states have call predecessors, (729), 724 states have return successors, (1074), 810 states have call predecessors, (1074), 726 states have call successors, (1074) [2021-12-14 16:18:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7363 states to 7363 states and 8706 transitions. [2021-12-14 16:18:31,272 INFO L78 Accepts]: Start accepts. Automaton has 7363 states and 8706 transitions. Word has length 141 [2021-12-14 16:18:31,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:18:31,272 INFO L470 AbstractCegarLoop]: Abstraction has 7363 states and 8706 transitions. [2021-12-14 16:18:31,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 16:18:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 7363 states and 8706 transitions. [2021-12-14 16:18:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-14 16:18:31,279 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:18:31,279 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 16:18:31,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-14 16:18:31,279 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:18:31,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:18:31,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1025674187, now seen corresponding path program 1 times [2021-12-14 16:18:31,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:18:31,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465566856] [2021-12-14 16:18:31,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:18:31,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:18:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:18:31,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 16:18:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:18:31,348 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 16:18:31,349 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 16:18:31,349 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-14 16:18:31,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-14 16:18:31,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-14 16:18:31,354 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:18:31,357 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 16:18:31,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:18:31 BoogieIcfgContainer [2021-12-14 16:18:31,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 16:18:31,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 16:18:31,482 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 16:18:31,482 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 16:18:31,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:17:51" (3/4) ... [2021-12-14 16:18:31,484 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 16:18:31,603 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 16:18:31,605 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 16:18:31,606 INFO L158 Benchmark]: Toolchain (without parser) took 41434.91ms. Allocated memory was 94.4MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 60.2MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 179.4MB. Max. memory is 16.1GB. [2021-12-14 16:18:31,606 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 77.6MB. Free memory was 57.1MB in the beginning and 57.1MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 16:18:31,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.26ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 65.5MB in the end (delta: -5.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-14 16:18:31,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.20ms. Allocated memory is still 94.4MB. Free memory was 65.5MB in the beginning and 62.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:18:31,607 INFO L158 Benchmark]: Boogie Preprocessor took 65.25ms. Allocated memory is still 94.4MB. Free memory was 62.8MB in the beginning and 60.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:18:31,608 INFO L158 Benchmark]: RCFGBuilder took 639.58ms. Allocated memory is still 94.4MB. Free memory was 60.7MB in the beginning and 67.9MB in the end (delta: -7.2MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2021-12-14 16:18:31,609 INFO L158 Benchmark]: TraceAbstraction took 40210.81ms. Allocated memory was 94.4MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 67.4MB in the beginning and 3.6GB in the end (delta: -3.6GB). Peak memory consumption was 165.8MB. Max. memory is 16.1GB. [2021-12-14 16:18:31,609 INFO L158 Benchmark]: Witness Printer took 123.49ms. Allocated memory is still 3.8GB. Free memory was 3.6GB in the beginning and 3.6GB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-14 16:18:31,611 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.20ms. Allocated memory is still 77.6MB. Free memory was 57.1MB in the beginning and 57.1MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.26ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 65.5MB in the end (delta: -5.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.20ms. Allocated memory is still 94.4MB. Free memory was 65.5MB in the beginning and 62.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.25ms. Allocated memory is still 94.4MB. Free memory was 62.8MB in the beginning and 60.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 639.58ms. Allocated memory is still 94.4MB. Free memory was 60.7MB in the beginning and 67.9MB in the end (delta: -7.2MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 40210.81ms. Allocated memory was 94.4MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 67.4MB in the beginning and 3.6GB in the end (delta: -3.6GB). Peak memory consumption was 165.8MB. Max. memory is 16.1GB. * Witness Printer took 123.49ms. Allocated memory is still 3.8GB. Free memory was 3.6GB in the beginning and 3.6GB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. 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 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L974] COND FALSE !(__VERIFIER_nondet_int()) [L977] CALL main2() [L961] int __retres1 ; [L965] CALL init_model2() [L876] m_i = 1 [L877] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L965] RET init_model2() [L966] CALL start_simulation2() [L902] int kernel_st ; [L903] int tmp ; [L904] int tmp___0 ; [L908] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L909] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] CALL init_threads2() [L658] COND TRUE m_i == 1 [L659] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L663] COND TRUE t1_i == 1 [L664] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] RET init_threads2() [L911] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L747] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L752] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L757] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L762] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L911] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L912] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L612] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L622] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L624] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L631] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L643] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L912] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L775] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L780] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L785] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L790] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L919] kernel_st = 1 [L920] CALL eval2() [L694] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L531] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L534] token = __VERIFIER_nondet_int() [L535] local = token [L536] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L537] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L829] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L612] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L624] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L631] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L632] COND TRUE E_1 == 1 [L633] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L643] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L829] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L537] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L538] E_1 = 2 [L539] m_pc = 1 [L540] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L714] RET master() [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L579] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L595] token += 1 [L596] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L829] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L612] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L613] COND TRUE E_M == 1 [L614] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L624] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L631] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L632] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L641] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L643] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L829] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L598] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L523] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L545] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L550] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L551] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L556] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L557] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L558] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L559] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L496] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 216 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 40.0s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 21.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15157 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14778 mSDsluCounter, 25122 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16193 mSDsCounter, 3783 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11886 IncrementalHoareTripleChecker+Invalid, 15669 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3783 mSolverCounterUnsat, 8929 mSDtfsCounter, 11886 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2117 GetRequests, 1753 SyntacticMatches, 5 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14299occurred in iteration=18, InterpolantAutomatonStates: 324, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 9189 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 3780 NumberOfCodeBlocks, 3780 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3674 ConstructedInterpolants, 0 QuantifiedInterpolants, 7219 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3759 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 38 InterpolantComputations, 27 PerfectInterpolantSequences, 1262/1339 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 RESULT: Ultimate proved your program to be incorrect! [2021-12-14 16:18:31,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE