./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 e19ca921 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-dev-e19ca92 [2021-12-22 13:12:13,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 13:12:13,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 13:12:13,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 13:12:13,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 13:12:13,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 13:12:13,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 13:12:13,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 13:12:13,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 13:12:13,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 13:12:13,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 13:12:13,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 13:12:13,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 13:12:13,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 13:12:13,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 13:12:13,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 13:12:13,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 13:12:13,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 13:12:13,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 13:12:13,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 13:12:13,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 13:12:13,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 13:12:13,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 13:12:13,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 13:12:13,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 13:12:13,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 13:12:13,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 13:12:13,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 13:12:13,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 13:12:13,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 13:12:13,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 13:12:13,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 13:12:13,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 13:12:13,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 13:12:13,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 13:12:13,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 13:12:13,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 13:12:13,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 13:12:13,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 13:12:13,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 13:12:13,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 13:12:13,227 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 13:12:13,258 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 13:12:13,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 13:12:13,258 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 13:12:13,259 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 13:12:13,259 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 13:12:13,260 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 13:12:13,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 13:12:13,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 13:12:13,261 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 13:12:13,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 13:12:13,262 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 13:12:13,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 13:12:13,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 13:12:13,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 13:12:13,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 13:12:13,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 13:12:13,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 13:12:13,263 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 13:12:13,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 13:12:13,263 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 13:12:13,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 13:12:13,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 13:12:13,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 13:12:13,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 13:12:13,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:12:13,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 13:12:13,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 13:12:13,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 13:12:13,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 13:12:13,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 13:12:13,265 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 13:12:13,266 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 13:12:13,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 13:12:13,266 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 13:12:13,266 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-22 13:12:13,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 13:12:13,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 13:12:13,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 13:12:13,527 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 13:12:13,528 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 13:12:13,529 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-22 13:12:13,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530c7af00/f56b97da744d4509aba762e279f8aac4/FLAG7168419eb [2021-12-22 13:12:14,015 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 13:12:14,017 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-22 13:12:14,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530c7af00/f56b97da744d4509aba762e279f8aac4/FLAG7168419eb [2021-12-22 13:12:14,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530c7af00/f56b97da744d4509aba762e279f8aac4 [2021-12-22 13:12:14,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 13:12:14,050 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 13:12:14,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 13:12:14,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 13:12:14,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 13:12:14,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:12:14" (1/1) ... [2021-12-22 13:12:14,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0892a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:12:14, skipping insertion in model container [2021-12-22 13:12:14,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:12:14" (1/1) ... [2021-12-22 13:12:14,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 13:12:14,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 13:12:14,247 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-22 13:12:14,300 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-22 13:12:14,335 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:12:14,348 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 13:12:14,357 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-22 13:12:14,372 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-22 13:12:14,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:12:14,404 INFO L208 MainTranslator]: Completed translation [2021-12-22 13:12:14,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:12:14 WrapperNode [2021-12-22 13:12:14,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 13:12:14,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 13:12:14,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 13:12:14,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 13:12:14,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:12:14" (1/1) ... [2021-12-22 13:12:14,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:12:14" (1/1) ... [2021-12-22 13:12:14,444 INFO L137 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 407 [2021-12-22 13:12:14,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 13:12:14,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 13:12:14,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 13:12:14,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 13:12:14,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:12:14" (1/1) ... [2021-12-22 13:12:14,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:12:14" (1/1) ... [2021-12-22 13:12:14,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:12:14" (1/1) ... [2021-12-22 13:12:14,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:12:14" (1/1) ... [2021-12-22 13:12:14,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:12:14" (1/1) ... [2021-12-22 13:12:14,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:12:14" (1/1) ... [2021-12-22 13:12:14,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:12:14" (1/1) ... [2021-12-22 13:12:14,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 13:12:14,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 13:12:14,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 13:12:14,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 13:12:14,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:12:14" (1/1) ... [2021-12-22 13:12:14,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:12:14,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:12:14,508 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-22 13:12:14,511 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-22 13:12:14,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 13:12:14,537 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-22 13:12:14,538 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-22 13:12:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-22 13:12:14,539 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-22 13:12:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-22 13:12:14,539 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-22 13:12:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-22 13:12:14,539 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-22 13:12:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-22 13:12:14,540 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-22 13:12:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-22 13:12:14,540 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-22 13:12:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-22 13:12:14,540 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-22 13:12:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-22 13:12:14,541 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-22 13:12:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-22 13:12:14,541 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-22 13:12:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-22 13:12:14,541 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-22 13:12:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-22 13:12:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-22 13:12:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 13:12:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-22 13:12:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-22 13:12:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-22 13:12:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-22 13:12:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 13:12:14,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 13:12:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-22 13:12:14,543 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-22 13:12:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2021-12-22 13:12:14,543 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2021-12-22 13:12:14,614 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 13:12:14,615 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 13:12:15,040 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 13:12:15,048 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 13:12:15,049 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-22 13:12:15,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:12:15 BoogieIcfgContainer [2021-12-22 13:12:15,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 13:12:15,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 13:12:15,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 13:12:15,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 13:12:15,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:12:14" (1/3) ... [2021-12-22 13:12:15,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6647207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:12:15, skipping insertion in model container [2021-12-22 13:12:15,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:12:14" (2/3) ... [2021-12-22 13:12:15,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6647207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:12:15, skipping insertion in model container [2021-12-22 13:12:15,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:12:15" (3/3) ... [2021-12-22 13:12:15,060 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2021-12-22 13:12:15,065 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 13:12:15,066 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-22 13:12:15,101 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 13:12:15,107 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-22 13:12:15,108 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-22 13:12:15,137 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-22 13:12:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 13:12:15,154 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:15,155 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-22 13:12:15,155 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:15,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:15,160 INFO L85 PathProgramCache]: Analyzing trace with hash 243262796, now seen corresponding path program 1 times [2021-12-22 13:12:15,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:15,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968210137] [2021-12-22 13:12:15,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:15,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:15,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:15,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:12:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:15,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:12:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:15,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:12:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:15,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:12:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:15,519 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-22 13:12:15,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:15,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968210137] [2021-12-22 13:12:15,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968210137] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:15,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:15,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:12:15,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862459984] [2021-12-22 13:12:15,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:15,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:12:15,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:15,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:12:15,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:12:15,556 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-22 13:12:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:16,261 INFO L93 Difference]: Finished difference Result 552 states and 832 transitions. [2021-12-22 13:12:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:12:16,263 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-22 13:12:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:16,274 INFO L225 Difference]: With dead ends: 552 [2021-12-22 13:12:16,274 INFO L226 Difference]: Without dead ends: 343 [2021-12-22 13:12:16,278 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-22 13:12:16,281 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-22 13:12:16,282 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-22 13:12:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-12-22 13:12:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 300. [2021-12-22 13:12:16,340 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-22 13:12:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2021-12-22 13:12:16,343 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 58 [2021-12-22 13:12:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:16,344 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2021-12-22 13:12:16,344 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-22 13:12:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2021-12-22 13:12:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 13:12:16,347 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:16,347 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-22 13:12:16,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 13:12:16,348 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:16,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:16,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2037521992, now seen corresponding path program 1 times [2021-12-22 13:12:16,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:16,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593943797] [2021-12-22 13:12:16,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:16,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:16,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:16,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:12:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:16,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:12:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:16,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:12:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:16,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:12:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:16,436 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-22 13:12:16,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:16,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593943797] [2021-12-22 13:12:16,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593943797] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:16,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:16,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:12:16,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412777345] [2021-12-22 13:12:16,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:16,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:12:16,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:16,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:12:16,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:12:16,440 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-22 13:12:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:17,122 INFO L93 Difference]: Finished difference Result 651 states and 934 transitions. [2021-12-22 13:12:17,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 13:12:17,123 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-22 13:12:17,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:17,127 INFO L225 Difference]: With dead ends: 651 [2021-12-22 13:12:17,127 INFO L226 Difference]: Without dead ends: 456 [2021-12-22 13:12:17,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-22 13:12:17,130 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 527 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:17,131 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.5s Time] [2021-12-22 13:12:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-12-22 13:12:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 390. [2021-12-22 13:12:17,166 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-22 13:12:17,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 553 transitions. [2021-12-22 13:12:17,170 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 553 transitions. Word has length 58 [2021-12-22 13:12:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:17,171 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 553 transitions. [2021-12-22 13:12:17,171 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-22 13:12:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 553 transitions. [2021-12-22 13:12:17,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 13:12:17,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:17,180 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-22 13:12:17,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 13:12:17,180 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:17,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:17,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1363958966, now seen corresponding path program 1 times [2021-12-22 13:12:17,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:17,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605822975] [2021-12-22 13:12:17,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:17,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:17,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:17,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:12:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:17,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:12:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:17,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:12:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:17,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:12:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:17,260 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-22 13:12:17,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:17,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605822975] [2021-12-22 13:12:17,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605822975] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:17,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:17,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:12:17,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829478549] [2021-12-22 13:12:17,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:17,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:12:17,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:17,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:12:17,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:12:17,263 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-22 13:12:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:17,979 INFO L93 Difference]: Finished difference Result 1002 states and 1431 transitions. [2021-12-22 13:12:17,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 13:12:17,979 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-22 13:12:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:17,984 INFO L225 Difference]: With dead ends: 1002 [2021-12-22 13:12:17,984 INFO L226 Difference]: Without dead ends: 717 [2021-12-22 13:12:17,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-22 13:12:17,987 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 530 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:17,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 1163 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-22 13:12:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-12-22 13:12:18,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 565. [2021-12-22 13:12:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 453 states have (on average 1.4503311258278146) internal successors, (657), 462 states have internal predecessors, (657), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2021-12-22 13:12:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 804 transitions. [2021-12-22 13:12:18,042 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 804 transitions. Word has length 58 [2021-12-22 13:12:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:18,042 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 804 transitions. [2021-12-22 13:12:18,042 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-22 13:12:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 804 transitions. [2021-12-22 13:12:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 13:12:18,044 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:18,044 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-22 13:12:18,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 13:12:18,044 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:18,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:18,045 INFO L85 PathProgramCache]: Analyzing trace with hash 881620488, now seen corresponding path program 1 times [2021-12-22 13:12:18,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:18,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043961692] [2021-12-22 13:12:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:18,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:18,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:12:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:18,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:12:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:18,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:12:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:18,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:12:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:18,177 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-22 13:12:18,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:18,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043961692] [2021-12-22 13:12:18,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043961692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:18,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:18,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:12:18,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446062117] [2021-12-22 13:12:18,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:18,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:12:18,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:18,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:12:18,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:12:18,188 INFO L87 Difference]: Start difference. First operand 565 states and 804 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-22 13:12:18,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:18,677 INFO L93 Difference]: Finished difference Result 1182 states and 1716 transitions. [2021-12-22 13:12:18,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:12:18,678 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-22 13:12:18,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:18,682 INFO L225 Difference]: With dead ends: 1182 [2021-12-22 13:12:18,682 INFO L226 Difference]: Without dead ends: 723 [2021-12-22 13:12:18,683 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-22 13:12:18,684 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 271 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:18,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 1086 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 13:12:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-12-22 13:12:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 580. [2021-12-22 13:12:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 468 states have (on average 1.435897435897436) internal successors, (672), 477 states have internal predecessors, (672), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2021-12-22 13:12:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 819 transitions. [2021-12-22 13:12:18,732 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 819 transitions. Word has length 58 [2021-12-22 13:12:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:18,733 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 819 transitions. [2021-12-22 13:12:18,733 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-22 13:12:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 819 transitions. [2021-12-22 13:12:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 13:12:18,734 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:18,734 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-22 13:12:18,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 13:12:18,735 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:18,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:18,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1362362810, now seen corresponding path program 1 times [2021-12-22 13:12:18,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:18,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056056980] [2021-12-22 13:12:18,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:18,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:18,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:18,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:12:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:18,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:12:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:18,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:12:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:18,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:12:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:18,827 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-22 13:12:18,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:18,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056056980] [2021-12-22 13:12:18,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056056980] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:18,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:18,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:12:18,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976547523] [2021-12-22 13:12:18,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:18,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:12:18,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:18,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:12:18,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:12:18,830 INFO L87 Difference]: Start difference. First operand 580 states and 819 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-22 13:12:19,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:19,784 INFO L93 Difference]: Finished difference Result 2468 states and 3598 transitions. [2021-12-22 13:12:19,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-22 13:12:19,784 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-22 13:12:19,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:19,794 INFO L225 Difference]: With dead ends: 2468 [2021-12-22 13:12:19,794 INFO L226 Difference]: Without dead ends: 1994 [2021-12-22 13:12:19,796 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-22 13:12:19,797 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 1041 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:19,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1062 Valid, 1009 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-22 13:12:19,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2021-12-22 13:12:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1739. [2021-12-22 13:12:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1384 states have (on average 1.3858381502890174) internal successors, (1918), 1420 states have internal predecessors, (1918), 210 states have call successors, (210), 129 states have call predecessors, (210), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2021-12-22 13:12:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2431 transitions. [2021-12-22 13:12:19,904 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2431 transitions. Word has length 58 [2021-12-22 13:12:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:19,905 INFO L470 AbstractCegarLoop]: Abstraction has 1739 states and 2431 transitions. [2021-12-22 13:12:19,905 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-22 13:12:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2431 transitions. [2021-12-22 13:12:19,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 13:12:19,906 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:19,906 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-22 13:12:19,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 13:12:19,907 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:19,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:19,907 INFO L85 PathProgramCache]: Analyzing trace with hash -652739814, now seen corresponding path program 1 times [2021-12-22 13:12:19,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:19,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825498749] [2021-12-22 13:12:19,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:19,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:19,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:12:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:19,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:12:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:19,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:19,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:19,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:12:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:20,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:12:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:20,006 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-22 13:12:20,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:20,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825498749] [2021-12-22 13:12:20,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825498749] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:20,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:20,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:12:20,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347143363] [2021-12-22 13:12:20,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:20,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:12:20,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:20,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:12:20,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:12:20,009 INFO L87 Difference]: Start difference. First operand 1739 states and 2431 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-22 13:12:20,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:20,598 INFO L93 Difference]: Finished difference Result 1962 states and 2746 transitions. [2021-12-22 13:12:20,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 13:12:20,598 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-22 13:12:20,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:20,610 INFO L225 Difference]: With dead ends: 1962 [2021-12-22 13:12:20,610 INFO L226 Difference]: Without dead ends: 1874 [2021-12-22 13:12:20,611 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-22 13:12:20,612 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 543 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:20,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 866 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 13:12:20,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2021-12-22 13:12:20,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1835. [2021-12-22 13:12:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1460 states have (on average 1.3856164383561644) internal successors, (2023), 1498 states have internal predecessors, (2023), 221 states have call successors, (221), 136 states have call predecessors, (221), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2021-12-22 13:12:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2563 transitions. [2021-12-22 13:12:20,706 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2563 transitions. Word has length 65 [2021-12-22 13:12:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:20,708 INFO L470 AbstractCegarLoop]: Abstraction has 1835 states and 2563 transitions. [2021-12-22 13:12:20,709 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-22 13:12:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2563 transitions. [2021-12-22 13:12:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 13:12:20,710 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:20,711 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-22 13:12:20,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 13:12:20,711 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:20,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1026148826, now seen corresponding path program 1 times [2021-12-22 13:12:20,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:20,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710092134] [2021-12-22 13:12:20,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:20,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:20,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:20,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:12:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:20,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:12:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:20,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:20,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:20,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:12:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:20,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:12:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:20,819 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-22 13:12:20,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:20,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710092134] [2021-12-22 13:12:20,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710092134] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:20,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:20,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:12:20,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611397034] [2021-12-22 13:12:20,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:20,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:12:20,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:20,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:12:20,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:12:20,821 INFO L87 Difference]: Start difference. First operand 1835 states and 2563 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-22 13:12:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:21,535 INFO L93 Difference]: Finished difference Result 2182 states and 3040 transitions. [2021-12-22 13:12:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:12:21,535 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-22 13:12:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:21,544 INFO L225 Difference]: With dead ends: 2182 [2021-12-22 13:12:21,544 INFO L226 Difference]: Without dead ends: 2005 [2021-12-22 13:12:21,545 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-22 13:12:21,548 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 706 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:21,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [727 Valid, 1139 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 13:12:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2021-12-22 13:12:21,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1931. [2021-12-22 13:12:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1536 states have (on average 1.384765625) internal successors, (2127), 1576 states have internal predecessors, (2127), 232 states have call successors, (232), 143 states have call predecessors, (232), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2021-12-22 13:12:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2697 transitions. [2021-12-22 13:12:21,653 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2697 transitions. Word has length 65 [2021-12-22 13:12:21,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:21,654 INFO L470 AbstractCegarLoop]: Abstraction has 1931 states and 2697 transitions. [2021-12-22 13:12:21,654 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-22 13:12:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2697 transitions. [2021-12-22 13:12:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 13:12:21,655 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:21,657 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-22 13:12:21,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 13:12:21,657 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:21,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:21,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1002437284, now seen corresponding path program 1 times [2021-12-22 13:12:21,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:21,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010485215] [2021-12-22 13:12:21,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:21,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:21,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:21,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:12:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:21,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:12:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:21,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:21,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:21,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:12:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:21,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:12:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:21,774 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-22 13:12:21,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:21,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010485215] [2021-12-22 13:12:21,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010485215] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:21,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:21,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:12:21,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270387544] [2021-12-22 13:12:21,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:21,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:12:21,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:21,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:12:21,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:12:21,776 INFO L87 Difference]: Start difference. First operand 1931 states and 2697 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-22 13:12:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:22,374 INFO L93 Difference]: Finished difference Result 2232 states and 3111 transitions. [2021-12-22 13:12:22,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:12:22,374 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-22 13:12:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:22,384 INFO L225 Difference]: With dead ends: 2232 [2021-12-22 13:12:22,384 INFO L226 Difference]: Without dead ends: 1965 [2021-12-22 13:12:22,385 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-22 13:12:22,386 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 212 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1415 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-22 13:12:22,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 1415 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 13:12:22,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2021-12-22 13:12:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1936. [2021-12-22 13:12:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1540 states have (on average 1.3824675324675324) internal successors, (2129), 1580 states have internal predecessors, (2129), 232 states have call successors, (232), 143 states have call predecessors, (232), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2021-12-22 13:12:22,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2700 transitions. [2021-12-22 13:12:22,507 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2700 transitions. Word has length 65 [2021-12-22 13:12:22,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:22,509 INFO L470 AbstractCegarLoop]: Abstraction has 1936 states and 2700 transitions. [2021-12-22 13:12:22,509 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-22 13:12:22,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2700 transitions. [2021-12-22 13:12:22,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 13:12:22,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:22,513 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-22 13:12:22,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 13:12:22,514 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:22,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2031796582, now seen corresponding path program 1 times [2021-12-22 13:12:22,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:22,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429915165] [2021-12-22 13:12:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:22,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:22,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:22,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:12:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:22,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:12:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:22,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:22,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:22,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:12:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:12:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:22,631 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-22 13:12:22,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:22,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429915165] [2021-12-22 13:12:22,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429915165] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:22,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:22,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:12:22,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290526726] [2021-12-22 13:12:22,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:22,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:12:22,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:22,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:12:22,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:12:22,633 INFO L87 Difference]: Start difference. First operand 1936 states and 2700 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-22 13:12:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:24,139 INFO L93 Difference]: Finished difference Result 3598 states and 4972 transitions. [2021-12-22 13:12:24,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-22 13:12:24,139 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-22 13:12:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:24,153 INFO L225 Difference]: With dead ends: 3598 [2021-12-22 13:12:24,153 INFO L226 Difference]: Without dead ends: 3326 [2021-12-22 13:12:24,155 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-22 13:12:24,156 INFO L933 BasicCegarLoop]: 501 mSDtfsCounter, 1549 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:24,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1567 Valid, 1386 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-22 13:12:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2021-12-22 13:12:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3076. [2021-12-22 13:12:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3076 states, 2440 states have (on average 1.3565573770491803) internal successors, (3310), 2500 states have internal predecessors, (3310), 349 states have call successors, (349), 245 states have call predecessors, (349), 285 states have return successors, (525), 337 states have call predecessors, (525), 345 states have call successors, (525) [2021-12-22 13:12:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4184 transitions. [2021-12-22 13:12:24,347 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4184 transitions. Word has length 65 [2021-12-22 13:12:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:24,347 INFO L470 AbstractCegarLoop]: Abstraction has 3076 states and 4184 transitions. [2021-12-22 13:12:24,347 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-22 13:12:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4184 transitions. [2021-12-22 13:12:24,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 13:12:24,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:24,352 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-22 13:12:24,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 13:12:24,352 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:24,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:24,353 INFO L85 PathProgramCache]: Analyzing trace with hash -980347493, now seen corresponding path program 1 times [2021-12-22 13:12:24,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:24,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756628395] [2021-12-22 13:12:24,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:24,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:24,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:24,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:12:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:24,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:12:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:24,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:24,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:12:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:24,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:12:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:24,471 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-22 13:12:24,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:24,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756628395] [2021-12-22 13:12:24,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756628395] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:24,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:24,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:12:24,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271075179] [2021-12-22 13:12:24,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:24,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:12:24,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:24,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:12:24,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:12:24,474 INFO L87 Difference]: Start difference. First operand 3076 states and 4184 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-22 13:12:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:25,079 INFO L93 Difference]: Finished difference Result 4677 states and 6308 transitions. [2021-12-22 13:12:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:12:25,079 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-22 13:12:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:25,092 INFO L225 Difference]: With dead ends: 4677 [2021-12-22 13:12:25,092 INFO L226 Difference]: Without dead ends: 3265 [2021-12-22 13:12:25,095 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-22 13:12:25,096 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 210 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:25,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 1408 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 13:12:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2021-12-22 13:12:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3121. [2021-12-22 13:12:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 2476 states have (on average 1.3477382875605817) internal successors, (3337), 2536 states have internal predecessors, (3337), 349 states have call successors, (349), 245 states have call predecessors, (349), 294 states have return successors, (537), 346 states have call predecessors, (537), 345 states have call successors, (537) [2021-12-22 13:12:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4223 transitions. [2021-12-22 13:12:25,269 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4223 transitions. Word has length 65 [2021-12-22 13:12:25,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:25,269 INFO L470 AbstractCegarLoop]: Abstraction has 3121 states and 4223 transitions. [2021-12-22 13:12:25,269 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-22 13:12:25,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4223 transitions. [2021-12-22 13:12:25,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 13:12:25,271 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:25,271 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-22 13:12:25,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 13:12:25,272 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash 405855901, now seen corresponding path program 1 times [2021-12-22 13:12:25,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:25,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877062806] [2021-12-22 13:12:25,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:25,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:25,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:25,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:12:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:25,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:12:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:25,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:25,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:25,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:12:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:25,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:12:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:25,350 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-22 13:12:25,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:25,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877062806] [2021-12-22 13:12:25,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877062806] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:25,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:25,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:12:25,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339017713] [2021-12-22 13:12:25,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:25,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:12:25,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:25,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:12:25,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:12:25,352 INFO L87 Difference]: Start difference. First operand 3121 states and 4223 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-22 13:12:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:26,047 INFO L93 Difference]: Finished difference Result 4556 states and 6062 transitions. [2021-12-22 13:12:26,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:12:26,047 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-22 13:12:26,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:26,061 INFO L225 Difference]: With dead ends: 4556 [2021-12-22 13:12:26,062 INFO L226 Difference]: Without dead ends: 3319 [2021-12-22 13:12:26,065 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-22 13:12:26,066 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 699 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:26,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [717 Valid, 901 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 13:12:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2021-12-22 13:12:26,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3099. [2021-12-22 13:12:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 2462 states have (on average 1.3456539398862712) internal successors, (3313), 2516 states have internal predecessors, (3313), 349 states have call successors, (349), 245 states have call predecessors, (349), 286 states have return successors, (521), 344 states have call predecessors, (521), 345 states have call successors, (521) [2021-12-22 13:12:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4183 transitions. [2021-12-22 13:12:26,261 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4183 transitions. Word has length 65 [2021-12-22 13:12:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:26,262 INFO L470 AbstractCegarLoop]: Abstraction has 3099 states and 4183 transitions. [2021-12-22 13:12:26,262 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-22 13:12:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4183 transitions. [2021-12-22 13:12:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 13:12:26,264 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:26,264 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-22 13:12:26,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 13:12:26,264 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:26,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:26,265 INFO L85 PathProgramCache]: Analyzing trace with hash 271842395, now seen corresponding path program 1 times [2021-12-22 13:12:26,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:26,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989436382] [2021-12-22 13:12:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:26,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:26,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:26,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:12:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:26,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:12:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:26,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:26,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:12:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:26,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:12:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:26,348 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-22 13:12:26,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:26,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989436382] [2021-12-22 13:12:26,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989436382] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:26,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:26,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:12:26,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337836307] [2021-12-22 13:12:26,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:26,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:12:26,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:26,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:12:26,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:12:26,350 INFO L87 Difference]: Start difference. First operand 3099 states and 4183 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-22 13:12:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:26,878 INFO L93 Difference]: Finished difference Result 6174 states and 8162 transitions. [2021-12-22 13:12:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:12:26,878 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-22 13:12:26,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:26,902 INFO L225 Difference]: With dead ends: 6174 [2021-12-22 13:12:26,903 INFO L226 Difference]: Without dead ends: 4742 [2021-12-22 13:12:26,907 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-22 13:12:26,907 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 810 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:26,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [834 Valid, 575 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 13:12:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4742 states. [2021-12-22 13:12:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4742 to 4470. [2021-12-22 13:12:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4470 states, 3528 states have (on average 1.312358276643991) internal successors, (4630), 3603 states have internal predecessors, (4630), 501 states have call successors, (501), 368 states have call predecessors, (501), 439 states have return successors, (793), 508 states have call predecessors, (793), 497 states have call successors, (793) [2021-12-22 13:12:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 5924 transitions. [2021-12-22 13:12:27,187 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 5924 transitions. Word has length 65 [2021-12-22 13:12:27,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:27,187 INFO L470 AbstractCegarLoop]: Abstraction has 4470 states and 5924 transitions. [2021-12-22 13:12:27,188 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-22 13:12:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 5924 transitions. [2021-12-22 13:12:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-22 13:12:27,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:27,190 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-22 13:12:27,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 13:12:27,191 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:27,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:27,191 INFO L85 PathProgramCache]: Analyzing trace with hash 520491120, now seen corresponding path program 1 times [2021-12-22 13:12:27,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:27,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866906907] [2021-12-22 13:12:27,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:27,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:27,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:12:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:27,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:12:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:27,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:27,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:27,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:12:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:27,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:12:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:27,251 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-22 13:12:27,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:27,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866906907] [2021-12-22 13:12:27,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866906907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:27,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:27,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:12:27,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476853308] [2021-12-22 13:12:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:27,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:12:27,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:27,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:12:27,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:12:27,253 INFO L87 Difference]: Start difference. First operand 4470 states and 5924 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-22 13:12:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:27,887 INFO L93 Difference]: Finished difference Result 9488 states and 12438 transitions. [2021-12-22 13:12:27,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:12:27,888 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-22 13:12:27,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:27,925 INFO L225 Difference]: With dead ends: 9488 [2021-12-22 13:12:27,926 INFO L226 Difference]: Without dead ends: 6664 [2021-12-22 13:12:27,931 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-22 13:12:27,932 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 381 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:27,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 848 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 13:12:27,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6664 states. [2021-12-22 13:12:28,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6664 to 6148. [2021-12-22 13:12:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6148 states, 4813 states have (on average 1.2944109702888011) internal successors, (6230), 4895 states have internal predecessors, (6230), 695 states have call successors, (695), 542 states have call predecessors, (695), 638 states have return successors, (1114), 720 states have call predecessors, (1114), 691 states have call successors, (1114) [2021-12-22 13:12:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 8039 transitions. [2021-12-22 13:12:28,325 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 8039 transitions. Word has length 66 [2021-12-22 13:12:28,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:28,327 INFO L470 AbstractCegarLoop]: Abstraction has 6148 states and 8039 transitions. [2021-12-22 13:12:28,327 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-22 13:12:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 8039 transitions. [2021-12-22 13:12:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-22 13:12:28,330 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:28,330 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-22 13:12:28,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 13:12:28,330 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:28,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:28,331 INFO L85 PathProgramCache]: Analyzing trace with hash 708381945, now seen corresponding path program 1 times [2021-12-22 13:12:28,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:28,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692664839] [2021-12-22 13:12:28,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:28,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:12:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:28,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:12:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:28,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:28,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:12:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:28,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:12:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:28,392 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-22 13:12:28,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:28,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692664839] [2021-12-22 13:12:28,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692664839] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:28,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:28,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:12:28,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055344390] [2021-12-22 13:12:28,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:28,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:12:28,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:28,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:12:28,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:12:28,394 INFO L87 Difference]: Start difference. First operand 6148 states and 8039 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-22 13:12:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:29,088 INFO L93 Difference]: Finished difference Result 7778 states and 10041 transitions. [2021-12-22 13:12:29,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:12:29,088 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-22 13:12:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:29,111 INFO L225 Difference]: With dead ends: 7778 [2021-12-22 13:12:29,111 INFO L226 Difference]: Without dead ends: 7775 [2021-12-22 13:12:29,113 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-22 13:12:29,113 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 946 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 588 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-22 13:12:29,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [955 Valid, 588 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 13:12:29,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7775 states. [2021-12-22 13:12:29,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7775 to 7202. [2021-12-22 13:12:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7202 states, 5616 states have (on average 1.2820512820512822) internal successors, (7200), 5707 states have internal predecessors, (7200), 821 states have call successors, (821), 656 states have call predecessors, (821), 763 states have return successors, (1307), 848 states have call predecessors, (1307), 818 states have call successors, (1307) [2021-12-22 13:12:29,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7202 states to 7202 states and 9328 transitions. [2021-12-22 13:12:29,484 INFO L78 Accepts]: Start accepts. Automaton has 7202 states and 9328 transitions. Word has length 73 [2021-12-22 13:12:29,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:29,484 INFO L470 AbstractCegarLoop]: Abstraction has 7202 states and 9328 transitions. [2021-12-22 13:12:29,485 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-22 13:12:29,485 INFO L276 IsEmpty]: Start isEmpty. Operand 7202 states and 9328 transitions. [2021-12-22 13:12:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-22 13:12:29,487 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:29,487 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-22 13:12:29,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 13:12:29,488 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:29,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:29,488 INFO L85 PathProgramCache]: Analyzing trace with hash 484349401, now seen corresponding path program 1 times [2021-12-22 13:12:29,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:29,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478115910] [2021-12-22 13:12:29,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:29,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:29,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:12:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:29,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:12:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:29,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:29,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:29,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:12:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:29,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:12:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:29,580 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-22 13:12:29,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:29,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478115910] [2021-12-22 13:12:29,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478115910] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:12:29,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180568834] [2021-12-22 13:12:29,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:29,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:12:29,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:12:29,587 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-22 13:12:29,611 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-22 13:12:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:29,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 13:12:29,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:12:30,161 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-22 13:12:30,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 13:12:30,390 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-22 13:12:30,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180568834] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 13:12:30,390 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 13:12:30,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2021-12-22 13:12:30,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78401444] [2021-12-22 13:12:30,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 13:12:30,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:12:30,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:30,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:12:30,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:12:30,394 INFO L87 Difference]: Start difference. First operand 7202 states and 9328 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-22 13:12:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:32,350 INFO L93 Difference]: Finished difference Result 14848 states and 18856 transitions. [2021-12-22 13:12:32,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-22 13:12:32,351 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-22 13:12:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:32,404 INFO L225 Difference]: With dead ends: 14848 [2021-12-22 13:12:32,405 INFO L226 Difference]: Without dead ends: 14845 [2021-12-22 13:12:32,415 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-22 13:12:32,417 INFO L933 BasicCegarLoop]: 450 mSDtfsCounter, 1129 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:32,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1187 Valid, 1652 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-22 13:12:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14845 states. [2021-12-22 13:12:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14845 to 12460. [2021-12-22 13:12:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12460 states, 9708 states have (on average 1.2679233621755253) internal successors, (12309), 9851 states have internal predecessors, (12309), 1387 states have call successors, (1387), 1146 states have call predecessors, (1387), 1363 states have return successors, (2246), 1472 states have call predecessors, (2246), 1384 states have call successors, (2246) [2021-12-22 13:12:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12460 states to 12460 states and 15942 transitions. [2021-12-22 13:12:33,277 INFO L78 Accepts]: Start accepts. Automaton has 12460 states and 15942 transitions. Word has length 74 [2021-12-22 13:12:33,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:33,277 INFO L470 AbstractCegarLoop]: Abstraction has 12460 states and 15942 transitions. [2021-12-22 13:12:33,278 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-22 13:12:33,278 INFO L276 IsEmpty]: Start isEmpty. Operand 12460 states and 15942 transitions. [2021-12-22 13:12:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-22 13:12:33,281 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:33,281 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-22 13:12:33,308 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-22 13:12:33,495 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-22 13:12:33,495 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:33,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:33,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1609727865, now seen corresponding path program 2 times [2021-12-22 13:12:33,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:33,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261102253] [2021-12-22 13:12:33,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:33,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:33,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:33,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:12:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:33,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:12:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:33,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:33,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:12:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:33,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:12:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:33,555 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-22 13:12:33,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:33,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261102253] [2021-12-22 13:12:33,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261102253] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:33,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:33,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:12:33,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382845410] [2021-12-22 13:12:33,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:33,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:12:33,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:33,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:12:33,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:12:33,557 INFO L87 Difference]: Start difference. First operand 12460 states and 15942 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-22 13:12:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:34,301 INFO L93 Difference]: Finished difference Result 19003 states and 24284 transitions. [2021-12-22 13:12:34,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:12:34,302 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-22 13:12:34,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:34,333 INFO L225 Difference]: With dead ends: 19003 [2021-12-22 13:12:34,334 INFO L226 Difference]: Without dead ends: 9065 [2021-12-22 13:12:34,361 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-22 13:12:34,362 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 440 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:34,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 842 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 13:12:34,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9065 states. [2021-12-22 13:12:34,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9065 to 8513. [2021-12-22 13:12:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8513 states, 6655 states have (on average 1.2545454545454546) internal successors, (8349), 6754 states have internal predecessors, (8349), 954 states have call successors, (954), 770 states have call predecessors, (954), 902 states have return successors, (1465), 998 states have call predecessors, (1465), 951 states have call successors, (1465) [2021-12-22 13:12:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8513 states to 8513 states and 10768 transitions. [2021-12-22 13:12:34,888 INFO L78 Accepts]: Start accepts. Automaton has 8513 states and 10768 transitions. Word has length 77 [2021-12-22 13:12:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:34,889 INFO L470 AbstractCegarLoop]: Abstraction has 8513 states and 10768 transitions. [2021-12-22 13:12:34,889 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-22 13:12:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 8513 states and 10768 transitions. [2021-12-22 13:12:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-22 13:12:34,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:34,893 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-22 13:12:34,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 13:12:34,894 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:34,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:34,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1048076277, now seen corresponding path program 1 times [2021-12-22 13:12:34,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:34,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987970605] [2021-12-22 13:12:34,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:34,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:34,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:12:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:34,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:12:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:34,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:34,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:34,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:12:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:34,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:12:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:34,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 13:12:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:34,975 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-22 13:12:34,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:34,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987970605] [2021-12-22 13:12:34,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987970605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:34,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:34,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:12:34,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279970184] [2021-12-22 13:12:34,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:34,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:12:34,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:34,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:12:34,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:12:34,977 INFO L87 Difference]: Start difference. First operand 8513 states and 10768 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-22 13:12:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:36,588 INFO L93 Difference]: Finished difference Result 22387 states and 27985 transitions. [2021-12-22 13:12:36,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-22 13:12:36,589 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-22 13:12:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:36,647 INFO L225 Difference]: With dead ends: 22387 [2021-12-22 13:12:36,648 INFO L226 Difference]: Without dead ends: 15544 [2021-12-22 13:12:36,673 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-22 13:12:36,674 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 765 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:36,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [781 Valid, 972 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-22 13:12:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15544 states. [2021-12-22 13:12:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15544 to 14685. [2021-12-22 13:12:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14685 states, 11331 states have (on average 1.2210749271908923) internal successors, (13836), 11536 states have internal predecessors, (13836), 1670 states have call successors, (1670), 1374 states have call predecessors, (1670), 1682 states have return successors, (2868), 1790 states have call predecessors, (2868), 1667 states have call successors, (2868) [2021-12-22 13:12:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14685 states to 14685 states and 18374 transitions. [2021-12-22 13:12:37,551 INFO L78 Accepts]: Start accepts. Automaton has 14685 states and 18374 transitions. Word has length 84 [2021-12-22 13:12:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:37,551 INFO L470 AbstractCegarLoop]: Abstraction has 14685 states and 18374 transitions. [2021-12-22 13:12:37,552 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-22 13:12:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 14685 states and 18374 transitions. [2021-12-22 13:12:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-22 13:12:37,559 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:37,559 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-22 13:12:37,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 13:12:37,560 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:37,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash -559065813, now seen corresponding path program 1 times [2021-12-22 13:12:37,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:37,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160900345] [2021-12-22 13:12:37,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:37,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:37,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:37,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:12:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:37,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:12:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:37,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:12:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:37,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:12:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:37,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-22 13:12:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:37,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:37,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-22 13:12:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:37,630 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-22 13:12:37,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:37,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160900345] [2021-12-22 13:12:37,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160900345] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:12:37,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921233228] [2021-12-22 13:12:37,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:37,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:12:37,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:12:37,636 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-22 13:12:37,659 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-22 13:12:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:37,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 13:12:37,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:12:37,856 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-22 13:12:37,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:12:37,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921233228] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:37,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:12:37,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-22 13:12:37,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426896378] [2021-12-22 13:12:37,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:37,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:12:37,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:37,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:12:37,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:12:37,858 INFO L87 Difference]: Start difference. First operand 14685 states and 18374 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-22 13:12:38,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:38,753 INFO L93 Difference]: Finished difference Result 17754 states and 22695 transitions. [2021-12-22 13:12:38,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:12:38,754 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-22 13:12:38,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:38,800 INFO L225 Difference]: With dead ends: 17754 [2021-12-22 13:12:38,801 INFO L226 Difference]: Without dead ends: 15078 [2021-12-22 13:12:38,811 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-22 13:12:38,812 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 114 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 676 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-22 13:12:38,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 676 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 13:12:38,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15078 states. [2021-12-22 13:12:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15078 to 15078. [2021-12-22 13:12:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15078 states, 11650 states have (on average 1.2243776824034336) internal successors, (14264), 11859 states have internal predecessors, (14264), 1712 states have call successors, (1712), 1402 states have call predecessors, (1712), 1714 states have return successors, (2932), 1832 states have call predecessors, (2932), 1709 states have call successors, (2932) [2021-12-22 13:12:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15078 states to 15078 states and 18908 transitions. [2021-12-22 13:12:39,617 INFO L78 Accepts]: Start accepts. Automaton has 15078 states and 18908 transitions. Word has length 93 [2021-12-22 13:12:39,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:39,618 INFO L470 AbstractCegarLoop]: Abstraction has 15078 states and 18908 transitions. [2021-12-22 13:12:39,618 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-22 13:12:39,618 INFO L276 IsEmpty]: Start isEmpty. Operand 15078 states and 18908 transitions. [2021-12-22 13:12:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-22 13:12:39,627 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:39,627 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-22 13:12:39,655 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-22 13:12:39,843 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-22 13:12:39,843 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:39,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:39,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2008597495, now seen corresponding path program 1 times [2021-12-22 13:12:39,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:39,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174522775] [2021-12-22 13:12:39,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:39,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:39,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:39,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:12:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:39,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:12:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:39,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:39,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:39,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:12:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:39,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:12:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:39,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 13:12:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:39,921 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-22 13:12:39,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:39,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174522775] [2021-12-22 13:12:39,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174522775] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:39,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:39,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:12:39,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121395841] [2021-12-22 13:12:39,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:39,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:12:39,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:39,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:12:39,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:12:39,924 INFO L87 Difference]: Start difference. First operand 15078 states and 18908 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-22 13:12:41,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:41,389 INFO L93 Difference]: Finished difference Result 25952 states and 32227 transitions. [2021-12-22 13:12:41,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-22 13:12:41,392 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-22 13:12:41,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:41,446 INFO L225 Difference]: With dead ends: 25952 [2021-12-22 13:12:41,446 INFO L226 Difference]: Without dead ends: 13553 [2021-12-22 13:12:41,484 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-22 13:12:41,485 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 1129 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:41,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1164 Valid, 1138 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-22 13:12:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13553 states. [2021-12-22 13:12:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13553 to 12653. [2021-12-22 13:12:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12653 states, 9816 states have (on average 1.2199470252648736) internal successors, (11975), 9992 states have internal predecessors, (11975), 1413 states have call successors, (1413), 1151 states have call predecessors, (1413), 1422 states have return successors, (2264), 1522 states have call predecessors, (2264), 1410 states have call successors, (2264) [2021-12-22 13:12:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12653 states to 12653 states and 15652 transitions. [2021-12-22 13:12:42,233 INFO L78 Accepts]: Start accepts. Automaton has 12653 states and 15652 transitions. Word has length 93 [2021-12-22 13:12:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:42,234 INFO L470 AbstractCegarLoop]: Abstraction has 12653 states and 15652 transitions. [2021-12-22 13:12:42,234 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-22 13:12:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 12653 states and 15652 transitions. [2021-12-22 13:12:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-22 13:12:42,246 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:42,246 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-22 13:12:42,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-22 13:12:42,246 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:42,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:42,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1056840823, now seen corresponding path program 1 times [2021-12-22 13:12:42,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:42,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801355719] [2021-12-22 13:12:42,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:42,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:42,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:42,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:12:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:42,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:12:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:42,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:12:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:42,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:12:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:42,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-22 13:12:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:42,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:42,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-22 13:12:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:42,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:42,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-22 13:12:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:42,340 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-22 13:12:42,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:42,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801355719] [2021-12-22 13:12:42,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801355719] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:12:42,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444544007] [2021-12-22 13:12:42,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:42,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:12:42,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:12:42,343 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-22 13:12:42,344 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-22 13:12:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:42,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 13:12:42,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:12:42,609 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-22 13:12:42,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:12:42,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444544007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:42,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:12:42,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-22 13:12:42,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356831733] [2021-12-22 13:12:42,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:42,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:12:42,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:42,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:12:42,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:12:42,612 INFO L87 Difference]: Start difference. First operand 12653 states and 15652 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-22 13:12:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:43,242 INFO L93 Difference]: Finished difference Result 15507 states and 19695 transitions. [2021-12-22 13:12:43,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:12:43,243 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-22 13:12:43,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:43,284 INFO L225 Difference]: With dead ends: 15507 [2021-12-22 13:12:43,285 INFO L226 Difference]: Without dead ends: 13862 [2021-12-22 13:12:43,298 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-22 13:12:43,299 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 209 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 444 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-22 13:12:43,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 444 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 13:12:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13862 states. [2021-12-22 13:12:44,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13862 to 13818. [2021-12-22 13:12:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13818 states, 10756 states have (on average 1.2332651543324655) internal successors, (13265), 10949 states have internal predecessors, (13265), 1541 states have call successors, (1541), 1236 states have call predecessors, (1541), 1519 states have return successors, (2444), 1645 states have call predecessors, (2444), 1538 states have call successors, (2444) [2021-12-22 13:12:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13818 states to 13818 states and 17250 transitions. [2021-12-22 13:12:44,145 INFO L78 Accepts]: Start accepts. Automaton has 13818 states and 17250 transitions. Word has length 119 [2021-12-22 13:12:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:44,146 INFO L470 AbstractCegarLoop]: Abstraction has 13818 states and 17250 transitions. [2021-12-22 13:12:44,146 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-22 13:12:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 13818 states and 17250 transitions. [2021-12-22 13:12:44,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-22 13:12:44,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:44,162 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-22 13:12:44,185 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-22 13:12:44,383 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-22 13:12:44,384 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:44,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash 131680678, now seen corresponding path program 1 times [2021-12-22 13:12:44,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:44,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377225991] [2021-12-22 13:12:44,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:44,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:44,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:44,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:12:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:44,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:12:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:44,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:12:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:44,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:12:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:44,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-22 13:12:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:44,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-22 13:12:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 13:12:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:44,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-22 13:12:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:44,480 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-22 13:12:44,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:44,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377225991] [2021-12-22 13:12:44,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377225991] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:12:44,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427043797] [2021-12-22 13:12:44,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:44,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:12:44,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:12:44,482 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-22 13:12:44,483 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-22 13:12:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:44,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 13:12:44,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:12:44,811 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-22 13:12:44,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:12:44,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427043797] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:44,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:12:44,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-22 13:12:44,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383286605] [2021-12-22 13:12:44,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:44,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:12:44,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:44,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:12:44,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:12:44,813 INFO L87 Difference]: Start difference. First operand 13818 states and 17250 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-22 13:12:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:45,516 INFO L93 Difference]: Finished difference Result 17504 states and 22428 transitions. [2021-12-22 13:12:45,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:12:45,517 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-22 13:12:45,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:45,551 INFO L225 Difference]: With dead ends: 17504 [2021-12-22 13:12:45,551 INFO L226 Difference]: Without dead ends: 14312 [2021-12-22 13:12:45,567 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-22 13:12:45,568 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 260 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 307 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-22 13:12:45,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 307 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 13:12:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14312 states. [2021-12-22 13:12:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14312 to 14202. [2021-12-22 13:12:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14202 states, 11115 states have (on average 1.2191632928475034) internal successors, (13551), 11303 states have internal predecessors, (13551), 1537 states have call successors, (1537), 1262 states have call predecessors, (1537), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2021-12-22 13:12:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14202 states to 14202 states and 17514 transitions. [2021-12-22 13:12:46,389 INFO L78 Accepts]: Start accepts. Automaton has 14202 states and 17514 transitions. Word has length 135 [2021-12-22 13:12:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:46,389 INFO L470 AbstractCegarLoop]: Abstraction has 14202 states and 17514 transitions. [2021-12-22 13:12:46,389 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-22 13:12:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 14202 states and 17514 transitions. [2021-12-22 13:12:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-22 13:12:46,402 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:46,402 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-22 13:12:46,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 13:12:46,625 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-22 13:12:46,626 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:46,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:46,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1548570021, now seen corresponding path program 1 times [2021-12-22 13:12:46,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:46,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610190469] [2021-12-22 13:12:46,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:46,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:46,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:46,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:12:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:46,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:12:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:46,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:12:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:46,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:12:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-22 13:12:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:46,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-22 13:12:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:46,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:46,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 13:12:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:46,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:46,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-22 13:12:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:46,720 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-22 13:12:46,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:46,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610190469] [2021-12-22 13:12:46,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610190469] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:12:46,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494471504] [2021-12-22 13:12:46,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:46,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:12:46,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:12:46,732 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-22 13:12:46,740 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-22 13:12:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:46,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 13:12:46,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:12:47,029 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-22 13:12:47,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:12:47,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494471504] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:47,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:12:47,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-22 13:12:47,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834785335] [2021-12-22 13:12:47,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:47,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:12:47,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:47,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:12:47,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:12:47,032 INFO L87 Difference]: Start difference. First operand 14202 states and 17514 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-22 13:12:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:47,702 INFO L93 Difference]: Finished difference Result 17861 states and 22355 transitions. [2021-12-22 13:12:47,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:12:47,703 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-22 13:12:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:47,732 INFO L225 Difference]: With dead ends: 17861 [2021-12-22 13:12:47,732 INFO L226 Difference]: Without dead ends: 14287 [2021-12-22 13:12:47,743 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-22 13:12:47,744 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 248 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 431 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-22 13:12:47,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 431 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 13:12:47,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14287 states. [2021-12-22 13:12:48,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14287 to 14172. [2021-12-22 13:12:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14172 states, 11085 states have (on average 1.211637347767253) internal successors, (13431), 11273 states have internal predecessors, (13431), 1537 states have call successors, (1537), 1262 states have call predecessors, (1537), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2021-12-22 13:12:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14172 states to 14172 states and 17394 transitions. [2021-12-22 13:12:48,595 INFO L78 Accepts]: Start accepts. Automaton has 14172 states and 17394 transitions. Word has length 135 [2021-12-22 13:12:48,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:48,595 INFO L470 AbstractCegarLoop]: Abstraction has 14172 states and 17394 transitions. [2021-12-22 13:12:48,596 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-22 13:12:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 14172 states and 17394 transitions. [2021-12-22 13:12:48,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-22 13:12:48,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:48,610 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-22 13:12:48,635 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-22 13:12:48,823 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-22 13:12:48,824 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:48,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash 367339351, now seen corresponding path program 1 times [2021-12-22 13:12:48,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:48,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158752470] [2021-12-22 13:12:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:48,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:48,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:48,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:12:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:48,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:12:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:48,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:12:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:48,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:12:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:48,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:12:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:48,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 13:12:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:48,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:48,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 13:12:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:48,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:48,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-22 13:12:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:48,914 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-22 13:12:48,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:48,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158752470] [2021-12-22 13:12:48,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158752470] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:12:48,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343571573] [2021-12-22 13:12:48,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:48,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:12:48,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:12:48,917 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-22 13:12:48,924 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-22 13:12:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:49,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 13:12:49,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:12:49,235 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-22 13:12:49,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:12:49,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343571573] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:49,236 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:12:49,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-22 13:12:49,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668729461] [2021-12-22 13:12:49,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:49,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:12:49,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:49,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:12:49,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:12:49,237 INFO L87 Difference]: Start difference. First operand 14172 states and 17394 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-22 13:12:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:49,761 INFO L93 Difference]: Finished difference Result 15677 states and 19438 transitions. [2021-12-22 13:12:49,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:12:49,762 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-22 13:12:49,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:49,798 INFO L225 Difference]: With dead ends: 15677 [2021-12-22 13:12:49,799 INFO L226 Difference]: Without dead ends: 13893 [2021-12-22 13:12:49,810 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-22 13:12:49,811 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 88 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 650 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-22 13:12:49,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 650 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 13:12:49,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13893 states. [2021-12-22 13:12:50,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13893 to 13829. [2021-12-22 13:12:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13829 states, 10810 states have (on average 1.2055504162812212) internal successors, (13032), 10994 states have internal predecessors, (13032), 1501 states have call successors, (1501), 1237 states have call predecessors, (1501), 1516 states have return successors, (2362), 1610 states have call predecessors, (2362), 1498 states have call successors, (2362) [2021-12-22 13:12:50,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13829 states to 13829 states and 16895 transitions. [2021-12-22 13:12:50,444 INFO L78 Accepts]: Start accepts. Automaton has 13829 states and 16895 transitions. Word has length 136 [2021-12-22 13:12:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:50,445 INFO L470 AbstractCegarLoop]: Abstraction has 13829 states and 16895 transitions. [2021-12-22 13:12:50,445 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-22 13:12:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 13829 states and 16895 transitions. [2021-12-22 13:12:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-22 13:12:50,454 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:50,454 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-22 13:12:50,478 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-22 13:12:50,678 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-22 13:12:50,679 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:50,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:50,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2008230337, now seen corresponding path program 1 times [2021-12-22 13:12:50,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:50,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493357409] [2021-12-22 13:12:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:50,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:50,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:50,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:12:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:50,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:12:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:50,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:12:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:50,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:12:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:50,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:12:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:50,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 13:12:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:50,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:50,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 13:12:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:50,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 13:12:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:50,770 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-22 13:12:50,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:50,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493357409] [2021-12-22 13:12:50,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493357409] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:12:50,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845158964] [2021-12-22 13:12:50,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:50,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:12:50,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:12:50,772 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-22 13:12:50,777 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-22 13:12:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:50,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 13:12:50,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:12:51,104 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-22 13:12:51,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:12:51,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845158964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:51,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:12:51,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-22 13:12:51,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103200689] [2021-12-22 13:12:51,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:51,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 13:12:51,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:51,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 13:12:51,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:12:51,109 INFO L87 Difference]: Start difference. First operand 13829 states and 16895 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-22 13:12:52,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:52,219 INFO L93 Difference]: Finished difference Result 15723 states and 19305 transitions. [2021-12-22 13:12:52,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 13:12:52,220 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-22 13:12:52,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:52,249 INFO L225 Difference]: With dead ends: 15723 [2021-12-22 13:12:52,249 INFO L226 Difference]: Without dead ends: 12689 [2021-12-22 13:12:52,259 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-22 13:12:52,260 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 339 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:12:52,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 525 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 13:12:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12689 states. [2021-12-22 13:12:53,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12689 to 12501. [2021-12-22 13:12:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12501 states, 9730 states have (on average 1.18879753340185) internal successors, (11567), 9890 states have internal predecessors, (11567), 1361 states have call successors, (1361), 1140 states have call predecessors, (1361), 1408 states have return successors, (2139), 1481 states have call predecessors, (2139), 1358 states have call successors, (2139) [2021-12-22 13:12:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12501 states to 12501 states and 15067 transitions. [2021-12-22 13:12:53,068 INFO L78 Accepts]: Start accepts. Automaton has 12501 states and 15067 transitions. Word has length 137 [2021-12-22 13:12:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:53,068 INFO L470 AbstractCegarLoop]: Abstraction has 12501 states and 15067 transitions. [2021-12-22 13:12:53,069 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-22 13:12:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 12501 states and 15067 transitions. [2021-12-22 13:12:53,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-22 13:12:53,081 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:53,081 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-22 13:12:53,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-22 13:12:53,294 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-22 13:12:53,295 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:53,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:53,295 INFO L85 PathProgramCache]: Analyzing trace with hash 979594561, now seen corresponding path program 1 times [2021-12-22 13:12:53,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:53,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832450163] [2021-12-22 13:12:53,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:53,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:53,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:53,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:12:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:53,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:12:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:53,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:12:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:53,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:12:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:53,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:12:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:53,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 13:12:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:53,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:53,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 13:12:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:53,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:53,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 13:12:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:53,386 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-22 13:12:53,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:53,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832450163] [2021-12-22 13:12:53,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832450163] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:12:53,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275799858] [2021-12-22 13:12:53,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:53,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:12:53,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:12:53,392 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-22 13:12:53,420 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-22 13:12:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:53,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 13:12:53,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:12:53,675 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-22 13:12:53,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:12:53,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275799858] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:53,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:12:53,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-22 13:12:53,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926876336] [2021-12-22 13:12:53,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:53,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 13:12:53,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:53,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 13:12:53,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:12:53,677 INFO L87 Difference]: Start difference. First operand 12501 states and 15067 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-22 13:12:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:54,298 INFO L93 Difference]: Finished difference Result 14431 states and 17466 transitions. [2021-12-22 13:12:54,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 13:12:54,299 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-22 13:12:54,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:54,326 INFO L225 Difference]: With dead ends: 14431 [2021-12-22 13:12:54,326 INFO L226 Difference]: Without dead ends: 12557 [2021-12-22 13:12:54,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:12:54,334 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-22 13:12:54,335 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-22 13:12:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12557 states. [2021-12-22 13:12:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12557 to 12525. [2021-12-22 13:12:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12525 states, 9754 states have (on average 1.1847447201148247) internal successors, (11556), 9914 states have internal predecessors, (11556), 1361 states have call successors, (1361), 1140 states have call predecessors, (1361), 1408 states have return successors, (2139), 1481 states have call predecessors, (2139), 1358 states have call successors, (2139) [2021-12-22 13:12:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12525 states to 12525 states and 15056 transitions. [2021-12-22 13:12:55,034 INFO L78 Accepts]: Start accepts. Automaton has 12525 states and 15056 transitions. Word has length 137 [2021-12-22 13:12:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:55,035 INFO L470 AbstractCegarLoop]: Abstraction has 12525 states and 15056 transitions. [2021-12-22 13:12:55,035 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-22 13:12:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 12525 states and 15056 transitions. [2021-12-22 13:12:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-22 13:12:55,042 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:55,043 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-22 13:12:55,061 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-22 13:12:55,244 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-22 13:12:55,244 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:55,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:55,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1021717307, now seen corresponding path program 1 times [2021-12-22 13:12:55,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:55,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772043173] [2021-12-22 13:12:55,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:55,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:55,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:55,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:12:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:55,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:12:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:12:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:55,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:12:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:55,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:12:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:55,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 13:12:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:55,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:55,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 13:12:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:55,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 13:12:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:55,325 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-22 13:12:55,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:55,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772043173] [2021-12-22 13:12:55,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772043173] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:55,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:55,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:12:55,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350582821] [2021-12-22 13:12:55,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:55,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:12:55,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:55,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:12:55,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:12:55,328 INFO L87 Difference]: Start difference. First operand 12525 states and 15056 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-22 13:12:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:56,515 INFO L93 Difference]: Finished difference Result 13983 states and 16730 transitions. [2021-12-22 13:12:56,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 13:12:56,515 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-22 13:12:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:56,553 INFO L225 Difference]: With dead ends: 13983 [2021-12-22 13:12:56,553 INFO L226 Difference]: Without dead ends: 13980 [2021-12-22 13:12:56,561 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-22 13:12:56,561 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-22 13:12:56,561 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-22 13:12:56,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13980 states. [2021-12-22 13:12:57,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13980 to 13496. [2021-12-22 13:12:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13496 states, 10552 states have (on average 1.182524639878696) internal successors, (12478), 10722 states have internal predecessors, (12478), 1454 states have call successors, (1454), 1207 states have call predecessors, (1454), 1488 states have return successors, (2252), 1577 states have call predecessors, (2252), 1451 states have call successors, (2252) [2021-12-22 13:12:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13496 states to 13496 states and 16184 transitions. [2021-12-22 13:12:57,271 INFO L78 Accepts]: Start accepts. Automaton has 13496 states and 16184 transitions. Word has length 137 [2021-12-22 13:12:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:57,272 INFO L470 AbstractCegarLoop]: Abstraction has 13496 states and 16184 transitions. [2021-12-22 13:12:57,272 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-22 13:12:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 13496 states and 16184 transitions. [2021-12-22 13:12:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-22 13:12:57,281 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:57,281 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-22 13:12:57,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-22 13:12:57,281 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:57,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:57,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1303301901, now seen corresponding path program 1 times [2021-12-22 13:12:57,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:57,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956983091] [2021-12-22 13:12:57,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:57,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:12:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:12:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:12:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:12:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 13:12:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 13:12:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-22 13:12:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-22 13:12:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:12:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:12:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-22 13:12:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-22 13:12:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-22 13:12:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,405 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-22 13:12:57,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:57,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956983091] [2021-12-22 13:12:57,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956983091] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:12:57,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018142887] [2021-12-22 13:12:57,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:57,406 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:12:57,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:12:57,408 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-22 13:12:57,437 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-22 13:12:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:57,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 13:12:57,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:12:57,715 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-22 13:12:57,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:12:57,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018142887] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:57,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:12:57,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2021-12-22 13:12:57,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649515013] [2021-12-22 13:12:57,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:57,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:12:57,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:57,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:12:57,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-22 13:12:57,716 INFO L87 Difference]: Start difference. First operand 13496 states and 16184 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-22 13:12:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:58,167 INFO L93 Difference]: Finished difference Result 18644 states and 22404 transitions. [2021-12-22 13:12:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 13:12:58,167 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-22 13:12:58,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:58,184 INFO L225 Difference]: With dead ends: 18644 [2021-12-22 13:12:58,184 INFO L226 Difference]: Without dead ends: 8062 [2021-12-22 13:12:58,198 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-22 13:12:58,198 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-22 13:12:58,199 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-22 13:12:58,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2021-12-22 13:12:58,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 7620. [2021-12-22 13:12:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7620 states, 6117 states have (on average 1.1678927578878535) internal successors, (7144), 6185 states have internal predecessors, (7144), 756 states have call successors, (756), 601 states have call predecessors, (756), 745 states have return successors, (1092), 835 states have call predecessors, (1092), 753 states have call successors, (1092) [2021-12-22 13:12:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7620 states to 7620 states and 8992 transitions. [2021-12-22 13:12:58,729 INFO L78 Accepts]: Start accepts. Automaton has 7620 states and 8992 transitions. Word has length 145 [2021-12-22 13:12:58,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:12:58,730 INFO L470 AbstractCegarLoop]: Abstraction has 7620 states and 8992 transitions. [2021-12-22 13:12:58,730 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-22 13:12:58,730 INFO L276 IsEmpty]: Start isEmpty. Operand 7620 states and 8992 transitions. [2021-12-22 13:12:58,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-22 13:12:58,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:12:58,736 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-22 13:12:58,753 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-22 13:12:58,937 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-22 13:12:58,937 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:12:58,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:12:58,938 INFO L85 PathProgramCache]: Analyzing trace with hash -72735443, now seen corresponding path program 1 times [2021-12-22 13:12:58,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:12:58,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800770233] [2021-12-22 13:12:58,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:12:58,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:12:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:58,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:12:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:58,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:12:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:58,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:12:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:58,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:12:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:12:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:58,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:12:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:58,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 13:12:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:58,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:58,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 13:12:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:59,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:12:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:59,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 13:12:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:12:59,016 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-22 13:12:59,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:12:59,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800770233] [2021-12-22 13:12:59,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800770233] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:12:59,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:12:59,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 13:12:59,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144728819] [2021-12-22 13:12:59,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:12:59,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 13:12:59,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:12:59,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 13:12:59,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 13:12:59,019 INFO L87 Difference]: Start difference. First operand 7620 states and 8992 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-22 13:12:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:12:59,687 INFO L93 Difference]: Finished difference Result 10269 states and 12313 transitions. [2021-12-22 13:12:59,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 13:12:59,688 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-22 13:12:59,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:12:59,707 INFO L225 Difference]: With dead ends: 10269 [2021-12-22 13:12:59,707 INFO L226 Difference]: Without dead ends: 8441 [2021-12-22 13:12:59,713 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-22 13:12:59,713 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-22 13:12:59,713 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-22 13:12:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8441 states. [2021-12-22 13:13:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8441 to 7623. [2021-12-22 13:13:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7623 states, 6120 states have (on average 1.16781045751634) internal successors, (7147), 6188 states have internal predecessors, (7147), 756 states have call successors, (756), 601 states have call predecessors, (756), 745 states have return successors, (1092), 835 states have call predecessors, (1092), 753 states have call successors, (1092) [2021-12-22 13:13:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7623 states to 7623 states and 8995 transitions. [2021-12-22 13:13:00,148 INFO L78 Accepts]: Start accepts. Automaton has 7623 states and 8995 transitions. Word has length 141 [2021-12-22 13:13:00,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:13:00,148 INFO L470 AbstractCegarLoop]: Abstraction has 7623 states and 8995 transitions. [2021-12-22 13:13:00,149 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-22 13:13:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 7623 states and 8995 transitions. [2021-12-22 13:13:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-22 13:13:00,154 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:13:00,154 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-22 13:13:00,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-22 13:13:00,154 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:13:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:13:00,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1025674187, now seen corresponding path program 1 times [2021-12-22 13:13:00,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:13:00,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644695204] [2021-12-22 13:13:00,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:13:00,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:13:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:13:00,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 13:13:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:13:00,216 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 13:13:00,217 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 13:13:00,217 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-22 13:13:00,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-22 13:13:00,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-22 13:13:00,222 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-22 13:13:00,225 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 13:13:00,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 01:13:00 BoogieIcfgContainer [2021-12-22 13:13:00,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 13:13:00,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 13:13:00,331 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 13:13:00,331 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 13:13:00,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:12:15" (3/4) ... [2021-12-22 13:13:00,333 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 13:13:00,434 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 13:13:00,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 13:13:00,435 INFO L158 Benchmark]: Toolchain (without parser) took 46385.16ms. Allocated memory was 90.2MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 55.5MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-12-22 13:13:00,435 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 90.2MB. Free memory was 60.0MB in the beginning and 60.0MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 13:13:00,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.12ms. Allocated memory is still 90.2MB. Free memory was 55.5MB in the beginning and 57.8MB in the end (delta: -2.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-22 13:13:00,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.30ms. Allocated memory is still 90.2MB. Free memory was 57.8MB in the beginning and 54.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-22 13:13:00,436 INFO L158 Benchmark]: Boogie Preprocessor took 28.14ms. Allocated memory is still 90.2MB. Free memory was 54.9MB in the beginning and 52.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 13:13:00,436 INFO L158 Benchmark]: RCFGBuilder took 577.00ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 52.8MB in the beginning and 72.4MB in the end (delta: -19.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2021-12-22 13:13:00,436 INFO L158 Benchmark]: TraceAbstraction took 45276.81ms. Allocated memory was 109.1MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 71.9MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-12-22 13:13:00,437 INFO L158 Benchmark]: Witness Printer took 104.05ms. Allocated memory is still 4.1GB. Free memory was 2.9GB in the beginning and 2.8GB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-22 13:13:00,438 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 90.2MB. Free memory was 60.0MB in the beginning and 60.0MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.12ms. Allocated memory is still 90.2MB. Free memory was 55.5MB in the beginning and 57.8MB in the end (delta: -2.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.30ms. Allocated memory is still 90.2MB. Free memory was 57.8MB in the beginning and 54.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.14ms. Allocated memory is still 90.2MB. Free memory was 54.9MB in the beginning and 52.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 577.00ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 52.8MB in the beginning and 72.4MB in the end (delta: -19.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * TraceAbstraction took 45276.81ms. Allocated memory was 109.1MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 71.9MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 104.05ms. Allocated memory is still 4.1GB. Free memory was 2.9GB in the beginning and 2.8GB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. 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=-2, 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=-2, 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=-2, 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: 45.1s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 24.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15067 SdHoareTripleChecker+Valid, 10.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14690 mSDsluCounter, 25893 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16798 mSDsCounter, 3697 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12655 IncrementalHoareTripleChecker+Invalid, 16352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3697 mSolverCounterUnsat, 9095 mSDtfsCounter, 12655 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2126 GetRequests, 1756 SyntacticMatches, 5 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15078occurred in iteration=18, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 9769 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, 7289 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-22 13:13:00,482 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