./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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_3.cil+token_ring.02.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 d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:15:00,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:15:00,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:15:00,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:15:00,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:15:00,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:15:00,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:15:00,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:15:00,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:15:00,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:15:00,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:15:00,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:15:00,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:15:00,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:15:00,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:15:00,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:15:00,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:15:00,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:15:00,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:15:00,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:15:00,258 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:15:00,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:15:00,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:15:00,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:15:00,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:15:00,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:15:00,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:15:00,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:15:00,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:15:00,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:15:00,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:15:00,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:15:00,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:15:00,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:15:00,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:15:00,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:15:00,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:15:00,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:15:00,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:15:00,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:15:00,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:15:00,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:15:00,279 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:15:00,308 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:15:00,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:15:00,309 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:15:00,309 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:15:00,310 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:15:00,310 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:15:00,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:15:00,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:15:00,310 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:15:00,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:15:00,311 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:15:00,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:15:00,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:15:00,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:15:00,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:15:00,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:15:00,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:15:00,312 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:15:00,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:15:00,313 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:15:00,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:15:00,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:15:00,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:15:00,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:15:00,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:15:00,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:15:00,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:15:00,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:15:00,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:15:00,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:15:00,315 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:15:00,315 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:15:00,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:15:00,315 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 -> d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae [2022-07-13 21:15:00,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:15:00,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:15:00,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:15:00,561 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:15:00,562 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:15:00,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-07-13 21:15:00,618 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e15410f3/6fa8f7be0a384b7982f82ea8210c7e0a/FLAGfc799b3a6 [2022-07-13 21:15:00,925 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:15:00,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-07-13 21:15:00,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e15410f3/6fa8f7be0a384b7982f82ea8210c7e0a/FLAGfc799b3a6 [2022-07-13 21:15:01,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e15410f3/6fa8f7be0a384b7982f82ea8210c7e0a [2022-07-13 21:15:01,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:15:01,357 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:15:01,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:15:01,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:15:01,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:15:01,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:15:01" (1/1) ... [2022-07-13 21:15:01,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730ee7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:15:01, skipping insertion in model container [2022-07-13 21:15:01,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:15:01" (1/1) ... [2022-07-13 21:15:01,369 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:15:01,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:15:01,527 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_3.cil+token_ring.02.cil-2.c[911,924] [2022-07-13 21:15:01,578 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_3.cil+token_ring.02.cil-2.c[8416,8429] [2022-07-13 21:15:01,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:15:01,627 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:15:01,635 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_3.cil+token_ring.02.cil-2.c[911,924] [2022-07-13 21:15:01,649 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_3.cil+token_ring.02.cil-2.c[8416,8429] [2022-07-13 21:15:01,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:15:01,677 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:15:01,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:15:01 WrapperNode [2022-07-13 21:15:01,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:15:01,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:15:01,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:15:01,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:15:01,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:15:01" (1/1) ... [2022-07-13 21:15:01,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:15:01" (1/1) ... [2022-07-13 21:15:01,737 INFO L137 Inliner]: procedures = 59, calls = 68, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 503 [2022-07-13 21:15:01,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:15:01,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:15:01,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:15:01,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:15:01,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:15:01" (1/1) ... [2022-07-13 21:15:01,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:15:01" (1/1) ... [2022-07-13 21:15:01,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:15:01" (1/1) ... [2022-07-13 21:15:01,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:15:01" (1/1) ... [2022-07-13 21:15:01,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:15:01" (1/1) ... [2022-07-13 21:15:01,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:15:01" (1/1) ... [2022-07-13 21:15:01,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:15:01" (1/1) ... [2022-07-13 21:15:01,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:15:01,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:15:01,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:15:01,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:15:01,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:15:01" (1/1) ... [2022-07-13 21:15:01,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:15:01,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:01,799 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) [2022-07-13 21:15:01,806 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 [2022-07-13 21:15:01,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:15:01,836 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-13 21:15:01,836 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-13 21:15:01,836 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-13 21:15:01,836 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-13 21:15:01,836 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-13 21:15:01,836 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-13 21:15:01,836 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-13 21:15:01,836 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-13 21:15:01,836 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-13 21:15:01,836 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-13 21:15:01,837 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-13 21:15:01,837 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-13 21:15:01,837 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-13 21:15:01,837 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-13 21:15:01,837 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-13 21:15:01,837 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-13 21:15:01,837 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-13 21:15:01,837 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-13 21:15:01,837 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-13 21:15:01,837 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-13 21:15:01,837 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-13 21:15:01,837 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-13 21:15:01,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:15:01,837 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-13 21:15:01,837 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-13 21:15:01,837 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-13 21:15:01,838 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-13 21:15:01,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:15:01,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:15:01,838 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-13 21:15:01,838 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-13 21:15:01,838 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-07-13 21:15:01,838 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-07-13 21:15:01,905 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:15:01,907 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:15:02,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-07-13 21:15:02,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-07-13 21:15:02,277 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:15:02,284 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:15:02,285 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-13 21:15:02,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:15:02 BoogieIcfgContainer [2022-07-13 21:15:02,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:15:02,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:15:02,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:15:02,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:15:02,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:15:01" (1/3) ... [2022-07-13 21:15:02,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bb4eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:15:02, skipping insertion in model container [2022-07-13 21:15:02,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:15:01" (2/3) ... [2022-07-13 21:15:02,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bb4eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:15:02, skipping insertion in model container [2022-07-13 21:15:02,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:15:02" (3/3) ... [2022-07-13 21:15:02,294 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-07-13 21:15:02,307 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:15:02,308 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:15:02,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:15:02,362 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4f0e7feb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1e50aa0f [2022-07-13 21:15:02,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-13 21:15:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 205 states have (on average 1.5658536585365854) internal successors, (321), 213 states have internal predecessors, (321), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2022-07-13 21:15:02,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:15:02,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:02,385 INFO L195 NwaCegarLoop]: 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] [2022-07-13 21:15:02,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:02,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:02,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1020803089, now seen corresponding path program 1 times [2022-07-13 21:15:02,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:02,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076218388] [2022-07-13 21:15:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:15:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:15:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:15:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:15:02,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:02,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076218388] [2022-07-13 21:15:02,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076218388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:02,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:02,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:15:02,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858619943] [2022-07-13 21:15:02,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:02,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:15:02,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:02,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:15:02,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:02,689 INFO L87 Difference]: Start difference. First operand has 257 states, 205 states have (on average 1.5658536585365854) internal successors, (321), 213 states have internal predecessors, (321), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) 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) [2022-07-13 21:15:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:03,448 INFO L93 Difference]: Finished difference Result 646 states and 985 transitions. [2022-07-13 21:15:03,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:15:03,450 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 [2022-07-13 21:15:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:03,460 INFO L225 Difference]: With dead ends: 646 [2022-07-13 21:15:03,460 INFO L226 Difference]: Without dead ends: 397 [2022-07-13 21:15:03,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-13 21:15:03,466 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 678 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:03,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1237 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 21:15:03,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-07-13 21:15:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 358. [2022-07-13 21:15:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 287 states have (on average 1.456445993031359) internal successors, (418), 294 states have internal predecessors, (418), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-07-13 21:15:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 513 transitions. [2022-07-13 21:15:03,523 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 513 transitions. Word has length 65 [2022-07-13 21:15:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:03,523 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 513 transitions. [2022-07-13 21:15:03,524 INFO L496 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) [2022-07-13 21:15:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 513 transitions. [2022-07-13 21:15:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:15:03,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:03,527 INFO L195 NwaCegarLoop]: 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] [2022-07-13 21:15:03,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:15:03,527 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:03,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1595275567, now seen corresponding path program 1 times [2022-07-13 21:15:03,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:03,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746939944] [2022-07-13 21:15:03,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:03,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:15:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:15:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:15:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:15:03,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:03,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746939944] [2022-07-13 21:15:03,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746939944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:03,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:03,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 21:15:03,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457858826] [2022-07-13 21:15:03,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:03,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:15:03,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:03,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:15:03,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:15:03,654 INFO L87 Difference]: Start difference. First operand 358 states and 513 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-13 21:15:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:05,051 INFO L93 Difference]: Finished difference Result 1391 states and 1973 transitions. [2022-07-13 21:15:05,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 21:15:05,052 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-07-13 21:15:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:05,057 INFO L225 Difference]: With dead ends: 1391 [2022-07-13 21:15:05,057 INFO L226 Difference]: Without dead ends: 1170 [2022-07-13 21:15:05,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 21:15:05,059 INFO L413 NwaCegarLoop]: 502 mSDtfsCounter, 2123 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2143 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:05,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2143 Valid, 1966 Invalid, 2224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 21:15:05,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2022-07-13 21:15:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1031. [2022-07-13 21:15:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 830 states have (on average 1.393975903614458) internal successors, (1157), 845 states have internal predecessors, (1157), 118 states have call successors, (118), 75 states have call predecessors, (118), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) [2022-07-13 21:15:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1403 transitions. [2022-07-13 21:15:05,149 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1403 transitions. Word has length 65 [2022-07-13 21:15:05,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:05,149 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1403 transitions. [2022-07-13 21:15:05,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-13 21:15:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1403 transitions. [2022-07-13 21:15:05,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 21:15:05,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:05,151 INFO L195 NwaCegarLoop]: 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] [2022-07-13 21:15:05,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:15:05,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:05,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash -306777911, now seen corresponding path program 1 times [2022-07-13 21:15:05,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:05,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943336725] [2022-07-13 21:15:05,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:05,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 21:15:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 21:15:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:15:05,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:05,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943336725] [2022-07-13 21:15:05,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943336725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:05,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:05,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:15:05,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212642193] [2022-07-13 21:15:05,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:05,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:15:05,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:05,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:15:05,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:15:05,280 INFO L87 Difference]: Start difference. First operand 1031 states and 1403 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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) [2022-07-13 21:15:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:05,866 INFO L93 Difference]: Finished difference Result 2057 states and 2797 transitions. [2022-07-13 21:15:05,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:15:05,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2022-07-13 21:15:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:05,871 INFO L225 Difference]: With dead ends: 2057 [2022-07-13 21:15:05,872 INFO L226 Difference]: Without dead ends: 1169 [2022-07-13 21:15:05,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-13 21:15:05,876 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 395 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:05,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1430 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:15:05,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-07-13 21:15:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1061. [2022-07-13 21:15:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 854 states have (on average 1.379391100702576) internal successors, (1178), 869 states have internal predecessors, (1178), 118 states have call successors, (118), 75 states have call predecessors, (118), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) [2022-07-13 21:15:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1430 transitions. [2022-07-13 21:15:05,921 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1430 transitions. Word has length 66 [2022-07-13 21:15:05,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:05,921 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1430 transitions. [2022-07-13 21:15:05,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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) [2022-07-13 21:15:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1430 transitions. [2022-07-13 21:15:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 21:15:05,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:05,923 INFO L195 NwaCegarLoop]: 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] [2022-07-13 21:15:05,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:15:05,924 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:05,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:05,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1336137209, now seen corresponding path program 1 times [2022-07-13 21:15:05,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:05,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748868861] [2022-07-13 21:15:05,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:05,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 21:15:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 21:15:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:06,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:15:06,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:06,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748868861] [2022-07-13 21:15:06,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748868861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:06,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:06,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 21:15:06,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619186457] [2022-07-13 21:15:06,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:06,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:15:06,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:06,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:15:06,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:15:06,004 INFO L87 Difference]: Start difference. First operand 1061 states and 1430 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 21:15:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:07,304 INFO L93 Difference]: Finished difference Result 3399 states and 4617 transitions. [2022-07-13 21:15:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 21:15:07,305 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-07-13 21:15:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:07,310 INFO L225 Difference]: With dead ends: 3399 [2022-07-13 21:15:07,310 INFO L226 Difference]: Without dead ends: 1304 [2022-07-13 21:15:07,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 21:15:07,316 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 2189 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 604 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:07,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2209 Valid, 1989 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [604 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 21:15:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-07-13 21:15:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1149. [2022-07-13 21:15:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 907 states have (on average 1.3395810363836824) internal successors, (1215), 922 states have internal predecessors, (1215), 138 states have call successors, (138), 89 states have call predecessors, (138), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) [2022-07-13 21:15:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1508 transitions. [2022-07-13 21:15:07,384 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1508 transitions. Word has length 66 [2022-07-13 21:15:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:07,384 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1508 transitions. [2022-07-13 21:15:07,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 21:15:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1508 transitions. [2022-07-13 21:15:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 21:15:07,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:07,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:07,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:15:07,388 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:07,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1682176981, now seen corresponding path program 1 times [2022-07-13 21:15:07,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:07,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888981454] [2022-07-13 21:15:07,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:07,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:15:07,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:07,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888981454] [2022-07-13 21:15:07,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888981454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:07,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:07,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:15:07,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778090514] [2022-07-13 21:15:07,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:07,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:15:07,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:07,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:15:07,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:15:07,463 INFO L87 Difference]: Start difference. First operand 1149 states and 1508 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2022-07-13 21:15:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:08,013 INFO L93 Difference]: Finished difference Result 1459 states and 1979 transitions. [2022-07-13 21:15:08,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:15:08,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 69 [2022-07-13 21:15:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:08,018 INFO L225 Difference]: With dead ends: 1459 [2022-07-13 21:15:08,018 INFO L226 Difference]: Without dead ends: 1335 [2022-07-13 21:15:08,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:15:08,019 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 667 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:08,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 897 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 21:15:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-07-13 21:15:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1270. [2022-07-13 21:15:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1010 states have (on average 1.3574257425742575) internal successors, (1371), 1026 states have internal predecessors, (1371), 149 states have call successors, (149), 95 states have call predecessors, (149), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2022-07-13 21:15:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1689 transitions. [2022-07-13 21:15:08,062 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1689 transitions. Word has length 69 [2022-07-13 21:15:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:08,062 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1689 transitions. [2022-07-13 21:15:08,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2022-07-13 21:15:08,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1689 transitions. [2022-07-13 21:15:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 21:15:08,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:08,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:08,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:15:08,063 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:08,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1579462617, now seen corresponding path program 1 times [2022-07-13 21:15:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:08,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927275432] [2022-07-13 21:15:08,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:08,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:15:08,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:08,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927275432] [2022-07-13 21:15:08,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927275432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:08,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:08,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:15:08,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010851686] [2022-07-13 21:15:08,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:08,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:15:08,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:08,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:15:08,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:15:08,120 INFO L87 Difference]: Start difference. First operand 1270 states and 1689 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-07-13 21:15:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:08,769 INFO L93 Difference]: Finished difference Result 1732 states and 2383 transitions. [2022-07-13 21:15:08,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:15:08,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2022-07-13 21:15:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:08,777 INFO L225 Difference]: With dead ends: 1732 [2022-07-13 21:15:08,777 INFO L226 Difference]: Without dead ends: 1487 [2022-07-13 21:15:08,778 INFO L412 NwaCegarLoop]: 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 [2022-07-13 21:15:08,779 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 684 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:08,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1103 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 21:15:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2022-07-13 21:15:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1384. [2022-07-13 21:15:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1106 states have (on average 1.367992766726944) internal successors, (1513), 1123 states have internal predecessors, (1513), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-07-13 21:15:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1855 transitions. [2022-07-13 21:15:08,828 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1855 transitions. Word has length 69 [2022-07-13 21:15:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:08,829 INFO L495 AbstractCegarLoop]: Abstraction has 1384 states and 1855 transitions. [2022-07-13 21:15:08,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-07-13 21:15:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1855 transitions. [2022-07-13 21:15:08,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 21:15:08,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:08,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:08,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:15:08,830 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:08,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:08,831 INFO L85 PathProgramCache]: Analyzing trace with hash -192677207, now seen corresponding path program 1 times [2022-07-13 21:15:08,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:08,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651401211] [2022-07-13 21:15:08,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:08,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:15:08,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:08,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651401211] [2022-07-13 21:15:08,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651401211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:08,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:08,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:15:08,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457699014] [2022-07-13 21:15:08,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:08,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:15:08,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:08,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:15:08,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:15:08,897 INFO L87 Difference]: Start difference. First operand 1384 states and 1855 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-07-13 21:15:09,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:09,269 INFO L93 Difference]: Finished difference Result 1842 states and 2549 transitions. [2022-07-13 21:15:09,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:15:09,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2022-07-13 21:15:09,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:09,275 INFO L225 Difference]: With dead ends: 1842 [2022-07-13 21:15:09,275 INFO L226 Difference]: Without dead ends: 1483 [2022-07-13 21:15:09,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:15:09,277 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 662 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:09,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 753 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:15:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2022-07-13 21:15:09,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1384. [2022-07-13 21:15:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1106 states have (on average 1.3652802893309222) internal successors, (1510), 1123 states have internal predecessors, (1510), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-07-13 21:15:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1852 transitions. [2022-07-13 21:15:09,337 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1852 transitions. Word has length 69 [2022-07-13 21:15:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:09,337 INFO L495 AbstractCegarLoop]: Abstraction has 1384 states and 1852 transitions. [2022-07-13 21:15:09,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-07-13 21:15:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1852 transitions. [2022-07-13 21:15:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 21:15:09,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:09,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:09,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:15:09,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:09,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash 251223467, now seen corresponding path program 1 times [2022-07-13 21:15:09,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:09,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135813531] [2022-07-13 21:15:09,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:09,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:15:09,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:09,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135813531] [2022-07-13 21:15:09,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135813531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:09,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:09,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:15:09,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113635544] [2022-07-13 21:15:09,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:09,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:15:09,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:09,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:15:09,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:15:09,393 INFO L87 Difference]: Start difference. First operand 1384 states and 1852 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-07-13 21:15:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:10,126 INFO L93 Difference]: Finished difference Result 2178 states and 3027 transitions. [2022-07-13 21:15:10,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 21:15:10,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2022-07-13 21:15:10,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:10,133 INFO L225 Difference]: With dead ends: 2178 [2022-07-13 21:15:10,133 INFO L226 Difference]: Without dead ends: 1819 [2022-07-13 21:15:10,135 INFO L412 NwaCegarLoop]: 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 [2022-07-13 21:15:10,135 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 708 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:10,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 1343 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 21:15:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2022-07-13 21:15:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1593. [2022-07-13 21:15:10,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1281 states have (on average 1.3762685402029664) internal successors, (1763), 1300 states have internal predecessors, (1763), 180 states have call successors, (180), 113 states have call predecessors, (180), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) [2022-07-13 21:15:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2153 transitions. [2022-07-13 21:15:10,200 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2153 transitions. Word has length 69 [2022-07-13 21:15:10,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:10,200 INFO L495 AbstractCegarLoop]: Abstraction has 1593 states and 2153 transitions. [2022-07-13 21:15:10,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-07-13 21:15:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2153 transitions. [2022-07-13 21:15:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 21:15:10,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:10,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:10,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:15:10,202 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:10,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:10,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1789563497, now seen corresponding path program 1 times [2022-07-13 21:15:10,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:10,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58154561] [2022-07-13 21:15:10,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:10,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:15:10,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:10,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58154561] [2022-07-13 21:15:10,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58154561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:10,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:10,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:15:10,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620529980] [2022-07-13 21:15:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:10,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:15:10,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:10,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:15:10,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:15:10,250 INFO L87 Difference]: Start difference. First operand 1593 states and 2153 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-07-13 21:15:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:10,984 INFO L93 Difference]: Finished difference Result 2881 states and 4034 transitions. [2022-07-13 21:15:10,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 21:15:10,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2022-07-13 21:15:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:10,995 INFO L225 Difference]: With dead ends: 2881 [2022-07-13 21:15:10,995 INFO L226 Difference]: Without dead ends: 2313 [2022-07-13 21:15:10,998 INFO L412 NwaCegarLoop]: 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 [2022-07-13 21:15:10,999 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 651 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:11,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1355 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 21:15:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2022-07-13 21:15:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2024. [2022-07-13 21:15:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1646 states have (on average 1.3955042527339003) internal successors, (2297), 1669 states have internal predecessors, (2297), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-07-13 21:15:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2785 transitions. [2022-07-13 21:15:11,099 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2785 transitions. Word has length 69 [2022-07-13 21:15:11,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:11,100 INFO L495 AbstractCegarLoop]: Abstraction has 2024 states and 2785 transitions. [2022-07-13 21:15:11,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-07-13 21:15:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2785 transitions. [2022-07-13 21:15:11,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 21:15:11,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:11,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:11,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 21:15:11,102 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:11,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:11,102 INFO L85 PathProgramCache]: Analyzing trace with hash -239022613, now seen corresponding path program 1 times [2022-07-13 21:15:11,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:11,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803128247] [2022-07-13 21:15:11,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:11,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:15:11,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:11,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803128247] [2022-07-13 21:15:11,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803128247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:11,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:11,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:15:11,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605335594] [2022-07-13 21:15:11,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:11,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:15:11,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:11,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:15:11,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:15:11,185 INFO L87 Difference]: Start difference. First operand 2024 states and 2785 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-07-13 21:15:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:11,789 INFO L93 Difference]: Finished difference Result 3560 states and 5064 transitions. [2022-07-13 21:15:11,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:15:11,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2022-07-13 21:15:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:11,798 INFO L225 Difference]: With dead ends: 3560 [2022-07-13 21:15:11,799 INFO L226 Difference]: Without dead ends: 2562 [2022-07-13 21:15:11,802 INFO L412 NwaCegarLoop]: 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 [2022-07-13 21:15:11,803 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 376 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:11,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1169 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:15:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2022-07-13 21:15:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2051. [2022-07-13 21:15:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2051 states, 1673 states have (on average 1.389121338912134) internal successors, (2324), 1696 states have internal predecessors, (2324), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-07-13 21:15:11,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2812 transitions. [2022-07-13 21:15:11,890 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2812 transitions. Word has length 69 [2022-07-13 21:15:11,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:11,890 INFO L495 AbstractCegarLoop]: Abstraction has 2051 states and 2812 transitions. [2022-07-13 21:15:11,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-07-13 21:15:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2812 transitions. [2022-07-13 21:15:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 21:15:11,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:11,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:11,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 21:15:11,893 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:11,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:11,893 INFO L85 PathProgramCache]: Analyzing trace with hash 9123881, now seen corresponding path program 1 times [2022-07-13 21:15:11,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:11,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580278595] [2022-07-13 21:15:11,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:11,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:15:11,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:11,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580278595] [2022-07-13 21:15:11,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580278595] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:11,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:11,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:15:11,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429204084] [2022-07-13 21:15:11,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:11,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:15:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:11,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:15:11,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:15:11,988 INFO L87 Difference]: Start difference. First operand 2051 states and 2812 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-07-13 21:15:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:13,125 INFO L93 Difference]: Finished difference Result 5545 states and 8068 transitions. [2022-07-13 21:15:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 21:15:13,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2022-07-13 21:15:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:13,143 INFO L225 Difference]: With dead ends: 5545 [2022-07-13 21:15:13,143 INFO L226 Difference]: Without dead ends: 4520 [2022-07-13 21:15:13,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-13 21:15:13,149 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 1435 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:13,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 1147 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 21:15:13,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2022-07-13 21:15:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 3969. [2022-07-13 21:15:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3969 states, 3269 states have (on average 1.4028754970939126) internal successors, (4586), 3323 states have internal predecessors, (4586), 410 states have call successors, (410), 251 states have call predecessors, (410), 288 states have return successors, (579), 403 states have call predecessors, (579), 406 states have call successors, (579) [2022-07-13 21:15:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3969 states to 3969 states and 5575 transitions. [2022-07-13 21:15:13,357 INFO L78 Accepts]: Start accepts. Automaton has 3969 states and 5575 transitions. Word has length 69 [2022-07-13 21:15:13,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:13,358 INFO L495 AbstractCegarLoop]: Abstraction has 3969 states and 5575 transitions. [2022-07-13 21:15:13,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2022-07-13 21:15:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3969 states and 5575 transitions. [2022-07-13 21:15:13,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 21:15:13,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:13,362 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:13,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 21:15:13,362 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:13,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash -411543486, now seen corresponding path program 1 times [2022-07-13 21:15:13,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:13,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365856432] [2022-07-13 21:15:13,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:13,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 21:15:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 21:15:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 21:15:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 21:15:13,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:13,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365856432] [2022-07-13 21:15:13,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365856432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:13,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:13,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:15:13,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819073322] [2022-07-13 21:15:13,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:13,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:15:13,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:13,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:15:13,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:15:13,460 INFO L87 Difference]: Start difference. First operand 3969 states and 5575 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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) [2022-07-13 21:15:14,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:14,105 INFO L93 Difference]: Finished difference Result 5146 states and 7126 transitions. [2022-07-13 21:15:14,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:15:14,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 91 [2022-07-13 21:15:14,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:14,123 INFO L225 Difference]: With dead ends: 5146 [2022-07-13 21:15:14,123 INFO L226 Difference]: Without dead ends: 4140 [2022-07-13 21:15:14,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-13 21:15:14,129 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 258 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:14,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1534 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:15:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2022-07-13 21:15:14,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 4009. [2022-07-13 21:15:14,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4009 states, 3301 states have (on average 1.3980611935777036) internal successors, (4615), 3355 states have internal predecessors, (4615), 410 states have call successors, (410), 251 states have call predecessors, (410), 296 states have return successors, (587), 411 states have call predecessors, (587), 406 states have call successors, (587) [2022-07-13 21:15:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 5612 transitions. [2022-07-13 21:15:14,343 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 5612 transitions. Word has length 91 [2022-07-13 21:15:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:14,343 INFO L495 AbstractCegarLoop]: Abstraction has 4009 states and 5612 transitions. [2022-07-13 21:15:14,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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) [2022-07-13 21:15:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 5612 transitions. [2022-07-13 21:15:14,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 21:15:14,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:14,349 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:14,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 21:15:14,350 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:14,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash 32357188, now seen corresponding path program 1 times [2022-07-13 21:15:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:14,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339463711] [2022-07-13 21:15:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 21:15:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 21:15:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 21:15:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 21:15:14,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:14,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339463711] [2022-07-13 21:15:14,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339463711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:14,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:14,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:15:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070961168] [2022-07-13 21:15:14,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:14,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:15:14,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:14,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:15:14,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:14,421 INFO L87 Difference]: Start difference. First operand 4009 states and 5612 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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) [2022-07-13 21:15:15,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:15,171 INFO L93 Difference]: Finished difference Result 6047 states and 8217 transitions. [2022-07-13 21:15:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 21:15:15,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 91 [2022-07-13 21:15:15,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:15,198 INFO L225 Difference]: With dead ends: 6047 [2022-07-13 21:15:15,198 INFO L226 Difference]: Without dead ends: 5002 [2022-07-13 21:15:15,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-07-13 21:15:15,205 INFO L413 NwaCegarLoop]: 373 mSDtfsCounter, 687 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:15,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 1303 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 21:15:15,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2022-07-13 21:15:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 4686. [2022-07-13 21:15:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4686 states, 3830 states have (on average 1.3783289817232376) internal successors, (5279), 3897 states have internal predecessors, (5279), 486 states have call successors, (486), 304 states have call predecessors, (486), 368 states have return successors, (700), 494 states have call predecessors, (700), 482 states have call successors, (700) [2022-07-13 21:15:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 6465 transitions. [2022-07-13 21:15:15,440 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 6465 transitions. Word has length 91 [2022-07-13 21:15:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:15,441 INFO L495 AbstractCegarLoop]: Abstraction has 4686 states and 6465 transitions. [2022-07-13 21:15:15,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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) [2022-07-13 21:15:15,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 6465 transitions. [2022-07-13 21:15:15,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 21:15:15,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:15,444 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:15,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 21:15:15,445 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:15,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:15,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1971519234, now seen corresponding path program 1 times [2022-07-13 21:15:15,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:15,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504979932] [2022-07-13 21:15:15,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:15,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:15,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:15,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:15,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:15,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:15,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:15,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 21:15:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:15,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 21:15:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:15,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 21:15:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 21:15:15,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:15,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504979932] [2022-07-13 21:15:15,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504979932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:15,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:15,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:15:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824875564] [2022-07-13 21:15:15,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:15,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:15:15,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:15,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:15:15,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:15:15,515 INFO L87 Difference]: Start difference. First operand 4686 states and 6465 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 21:15:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:16,111 INFO L93 Difference]: Finished difference Result 8345 states and 11247 transitions. [2022-07-13 21:15:16,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:15:16,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-07-13 21:15:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:16,130 INFO L225 Difference]: With dead ends: 8345 [2022-07-13 21:15:16,131 INFO L226 Difference]: Without dead ends: 6625 [2022-07-13 21:15:16,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-13 21:15:16,136 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 757 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:16,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 888 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:15:16,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2022-07-13 21:15:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 6405. [2022-07-13 21:15:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6405 states, 5168 states have (on average 1.3432662538699691) internal successors, (6942), 5271 states have internal predecessors, (6942), 679 states have call successors, (679), 438 states have call predecessors, (679), 556 states have return successors, (1040), 707 states have call predecessors, (1040), 675 states have call successors, (1040) [2022-07-13 21:15:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 8661 transitions. [2022-07-13 21:15:16,442 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 8661 transitions. Word has length 91 [2022-07-13 21:15:16,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:16,443 INFO L495 AbstractCegarLoop]: Abstraction has 6405 states and 8661 transitions. [2022-07-13 21:15:16,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 21:15:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 8661 transitions. [2022-07-13 21:15:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 21:15:16,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:16,447 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:16,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 21:15:16,448 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:16,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash 913681156, now seen corresponding path program 1 times [2022-07-13 21:15:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:16,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777315708] [2022-07-13 21:15:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:16,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 21:15:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 21:15:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 21:15:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 21:15:16,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:16,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777315708] [2022-07-13 21:15:16,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777315708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:16,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:16,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:15:16,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132556787] [2022-07-13 21:15:16,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:16,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:15:16,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:16,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:15:16,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:15:16,495 INFO L87 Difference]: Start difference. First operand 6405 states and 8661 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:15:16,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:16,874 INFO L93 Difference]: Finished difference Result 8243 states and 10964 transitions. [2022-07-13 21:15:16,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 21:15:16,875 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), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-07-13 21:15:16,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:16,901 INFO L225 Difference]: With dead ends: 8243 [2022-07-13 21:15:16,902 INFO L226 Difference]: Without dead ends: 4804 [2022-07-13 21:15:16,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:15:16,926 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 494 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:16,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 734 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:15:16,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4804 states. [2022-07-13 21:15:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4804 to 4686. [2022-07-13 21:15:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4686 states, 3830 states have (on average 1.3671018276762401) internal successors, (5236), 3897 states have internal predecessors, (5236), 486 states have call successors, (486), 304 states have call predecessors, (486), 368 states have return successors, (700), 494 states have call predecessors, (700), 482 states have call successors, (700) [2022-07-13 21:15:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 6422 transitions. [2022-07-13 21:15:17,136 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 6422 transitions. Word has length 91 [2022-07-13 21:15:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:17,137 INFO L495 AbstractCegarLoop]: Abstraction has 4686 states and 6422 transitions. [2022-07-13 21:15:17,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:15:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 6422 transitions. [2022-07-13 21:15:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 21:15:17,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:17,140 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:17,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 21:15:17,141 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:17,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1870290611, now seen corresponding path program 1 times [2022-07-13 21:15:17,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:17,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093916131] [2022-07-13 21:15:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 21:15:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 21:15:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 21:15:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 21:15:17,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:17,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093916131] [2022-07-13 21:15:17,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093916131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:17,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:17,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:15:17,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774215012] [2022-07-13 21:15:17,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:17,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:15:17,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:17,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:15:17,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:15:17,219 INFO L87 Difference]: Start difference. First operand 4686 states and 6422 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) [2022-07-13 21:15:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:18,283 INFO L93 Difference]: Finished difference Result 7512 states and 10024 transitions. [2022-07-13 21:15:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 21:15:18,289 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 92 [2022-07-13 21:15:18,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:18,304 INFO L225 Difference]: With dead ends: 7512 [2022-07-13 21:15:18,305 INFO L226 Difference]: Without dead ends: 5485 [2022-07-13 21:15:18,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-07-13 21:15:18,312 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 1774 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:18,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 1181 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 21:15:18,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5485 states. [2022-07-13 21:15:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5485 to 5308. [2022-07-13 21:15:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5308 states, 4296 states have (on average 1.3424115456238361) internal successors, (5767), 4371 states have internal predecessors, (5767), 564 states have call successors, (564), 352 states have call predecessors, (564), 446 states have return successors, (833), 594 states have call predecessors, (833), 560 states have call successors, (833) [2022-07-13 21:15:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5308 states to 5308 states and 7164 transitions. [2022-07-13 21:15:18,543 INFO L78 Accepts]: Start accepts. Automaton has 5308 states and 7164 transitions. Word has length 92 [2022-07-13 21:15:18,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:18,572 INFO L495 AbstractCegarLoop]: Abstraction has 5308 states and 7164 transitions. [2022-07-13 21:15:18,572 INFO L496 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) [2022-07-13 21:15:18,573 INFO L276 IsEmpty]: Start isEmpty. Operand 5308 states and 7164 transitions. [2022-07-13 21:15:18,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-13 21:15:18,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:18,577 INFO L195 NwaCegarLoop]: 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, 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] [2022-07-13 21:15:18,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 21:15:18,577 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:18,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:18,578 INFO L85 PathProgramCache]: Analyzing trace with hash 56705439, now seen corresponding path program 1 times [2022-07-13 21:15:18,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:18,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165010928] [2022-07-13 21:15:18,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:18,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 21:15:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 21:15:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 21:15:18,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:18,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165010928] [2022-07-13 21:15:18,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165010928] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:18,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743298008] [2022-07-13 21:15:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:18,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:18,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:18,649 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) [2022-07-13 21:15:18,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 21:15:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:15:18,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 21:15:18,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:18,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743298008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:18,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:18,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:15:18,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126888940] [2022-07-13 21:15:18,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:18,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:18,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:18,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:18,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:18,815 INFO L87 Difference]: Start difference. First operand 5308 states and 7164 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2022-07-13 21:15:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:19,117 INFO L93 Difference]: Finished difference Result 11026 states and 15472 transitions. [2022-07-13 21:15:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:19,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 111 [2022-07-13 21:15:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:19,136 INFO L225 Difference]: With dead ends: 11026 [2022-07-13 21:15:19,136 INFO L226 Difference]: Without dead ends: 5838 [2022-07-13 21:15:19,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:19,150 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 153 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 829 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 [2022-07-13 21:15:19,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 829 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:15:19,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5838 states. [2022-07-13 21:15:19,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5838 to 5838. [2022-07-13 21:15:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5838 states, 4743 states have (on average 1.3487244360109636) internal successors, (6397), 4822 states have internal predecessors, (6397), 613 states have call successors, (613), 382 states have call predecessors, (613), 480 states have return successors, (911), 643 states have call predecessors, (911), 609 states have call successors, (911) [2022-07-13 21:15:19,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5838 states to 5838 states and 7921 transitions. [2022-07-13 21:15:19,424 INFO L78 Accepts]: Start accepts. Automaton has 5838 states and 7921 transitions. Word has length 111 [2022-07-13 21:15:19,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:19,425 INFO L495 AbstractCegarLoop]: Abstraction has 5838 states and 7921 transitions. [2022-07-13 21:15:19,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2022-07-13 21:15:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 5838 states and 7921 transitions. [2022-07-13 21:15:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-13 21:15:19,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:19,435 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:19,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 21:15:19,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 21:15:19,652 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:19,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:19,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1296496829, now seen corresponding path program 1 times [2022-07-13 21:15:19,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:19,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774842876] [2022-07-13 21:15:19,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:19,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 21:15:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 21:15:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 21:15:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 21:15:19,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:19,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774842876] [2022-07-13 21:15:19,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774842876] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:19,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75505269] [2022-07-13 21:15:19,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:19,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:19,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:19,724 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) [2022-07-13 21:15:19,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 21:15:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:15:19,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 21:15:19,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:19,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75505269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:19,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:19,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-13 21:15:19,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178748883] [2022-07-13 21:15:19,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:19,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:19,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:19,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:19,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:19,945 INFO L87 Difference]: Start difference. First operand 5838 states and 7921 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2022-07-13 21:15:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:20,306 INFO L93 Difference]: Finished difference Result 12594 states and 17806 transitions. [2022-07-13 21:15:20,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:20,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 143 [2022-07-13 21:15:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:20,333 INFO L225 Difference]: With dead ends: 12594 [2022-07-13 21:15:20,333 INFO L226 Difference]: Without dead ends: 9121 [2022-07-13 21:15:20,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:20,345 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 252 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 518 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 [2022-07-13 21:15:20,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 518 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:15:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9121 states. [2022-07-13 21:15:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9121 to 9051. [2022-07-13 21:15:20,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9051 states, 7446 states have (on average 1.3759065269943593) internal successors, (10245), 7568 states have internal predecessors, (10245), 905 states have call successors, (905), 572 states have call predecessors, (905), 698 states have return successors, (1355), 920 states have call predecessors, (1355), 901 states have call successors, (1355) [2022-07-13 21:15:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9051 states to 9051 states and 12505 transitions. [2022-07-13 21:15:20,844 INFO L78 Accepts]: Start accepts. Automaton has 9051 states and 12505 transitions. Word has length 143 [2022-07-13 21:15:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:20,845 INFO L495 AbstractCegarLoop]: Abstraction has 9051 states and 12505 transitions. [2022-07-13 21:15:20,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2022-07-13 21:15:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 9051 states and 12505 transitions. [2022-07-13 21:15:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-13 21:15:20,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:20,859 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:20,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 21:15:21,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 21:15:21,078 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:21,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:21,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2080420097, now seen corresponding path program 1 times [2022-07-13 21:15:21,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:21,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181460280] [2022-07-13 21:15:21,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:21,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:21,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:21,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:21,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:21,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:21,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:21,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 21:15:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:21,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:21,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:15:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:21,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:21,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 21:15:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 21:15:21,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:21,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181460280] [2022-07-13 21:15:21,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181460280] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:21,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864733555] [2022-07-13 21:15:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:21,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:21,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:21,168 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) [2022-07-13 21:15:21,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 21:15:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:21,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:15:21,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 21:15:21,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:21,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864733555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:21,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:21,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-13 21:15:21,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070596319] [2022-07-13 21:15:21,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:21,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:21,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:21,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:21,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:21,368 INFO L87 Difference]: Start difference. First operand 9051 states and 12505 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2022-07-13 21:15:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:21,870 INFO L93 Difference]: Finished difference Result 16387 states and 23265 transitions. [2022-07-13 21:15:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:21,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 143 [2022-07-13 21:15:21,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:21,904 INFO L225 Difference]: With dead ends: 16387 [2022-07-13 21:15:21,905 INFO L226 Difference]: Without dead ends: 12177 [2022-07-13 21:15:21,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:21,921 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 253 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 538 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 [2022-07-13 21:15:21,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 538 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:15:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2022-07-13 21:15:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12077. [2022-07-13 21:15:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12077 states, 9997 states have (on average 1.3899169750925278) internal successors, (13895), 10153 states have internal predecessors, (13895), 1181 states have call successors, (1181), 747 states have call predecessors, (1181), 897 states have return successors, (1750), 1186 states have call predecessors, (1750), 1177 states have call successors, (1750) [2022-07-13 21:15:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12077 states to 12077 states and 16826 transitions. [2022-07-13 21:15:22,463 INFO L78 Accepts]: Start accepts. Automaton has 12077 states and 16826 transitions. Word has length 143 [2022-07-13 21:15:22,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:22,464 INFO L495 AbstractCegarLoop]: Abstraction has 12077 states and 16826 transitions. [2022-07-13 21:15:22,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2022-07-13 21:15:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 12077 states and 16826 transitions. [2022-07-13 21:15:22,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-13 21:15:22,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:22,480 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:22,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 21:15:22,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:22,699 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:22,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:22,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1194272178, now seen corresponding path program 1 times [2022-07-13 21:15:22,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:22,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859905184] [2022-07-13 21:15:22,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:22,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 21:15:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 21:15:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 21:15:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 21:15:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 21:15:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 21:15:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:15:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 21:15:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 21:15:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 21:15:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-13 21:15:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-13 21:15:22,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:22,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859905184] [2022-07-13 21:15:22,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859905184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:22,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281665952] [2022-07-13 21:15:22,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:22,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:22,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:22,800 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) [2022-07-13 21:15:22,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 21:15:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:22,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:15:22,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 21:15:22,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:22,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281665952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:22,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:22,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-13 21:15:22,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561378665] [2022-07-13 21:15:22,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:22,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:22,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:22,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:22,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:15:22,990 INFO L87 Difference]: Start difference. First operand 12077 states and 16826 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-13 21:15:23,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:23,475 INFO L93 Difference]: Finished difference Result 16402 states and 22141 transitions. [2022-07-13 21:15:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:23,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2022-07-13 21:15:23,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:23,518 INFO L225 Difference]: With dead ends: 16402 [2022-07-13 21:15:23,518 INFO L226 Difference]: Without dead ends: 14214 [2022-07-13 21:15:23,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:15:23,532 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 61 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:23,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 671 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:15:23,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14214 states. [2022-07-13 21:15:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14214 to 14169. [2022-07-13 21:15:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14169 states, 11622 states have (on average 1.3631905007743934) internal successors, (15843), 11807 states have internal predecessors, (15843), 1415 states have call successors, (1415), 929 states have call predecessors, (1415), 1130 states have return successors, (2057), 1442 states have call predecessors, (2057), 1411 states have call successors, (2057) [2022-07-13 21:15:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14169 states to 14169 states and 19315 transitions. [2022-07-13 21:15:24,168 INFO L78 Accepts]: Start accepts. Automaton has 14169 states and 19315 transitions. Word has length 163 [2022-07-13 21:15:24,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:24,169 INFO L495 AbstractCegarLoop]: Abstraction has 14169 states and 19315 transitions. [2022-07-13 21:15:24,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-13 21:15:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 14169 states and 19315 transitions. [2022-07-13 21:15:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-13 21:15:24,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:24,187 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:24,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 21:15:24,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:24,404 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:24,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:24,404 INFO L85 PathProgramCache]: Analyzing trace with hash 746982758, now seen corresponding path program 1 times [2022-07-13 21:15:24,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:24,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803987297] [2022-07-13 21:15:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:24,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:24,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:24,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:24,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:24,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:24,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 21:15:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:24,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 21:15:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:24,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:24,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 21:15:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:24,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:24,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 21:15:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-13 21:15:24,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:24,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803987297] [2022-07-13 21:15:24,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803987297] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:24,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631710955] [2022-07-13 21:15:24,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:24,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:24,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:24,477 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) [2022-07-13 21:15:24,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 21:15:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:24,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:15:24,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 21:15:24,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:24,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631710955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:24,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:24,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:15:24,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370211795] [2022-07-13 21:15:24,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:24,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:24,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:24,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:24,647 INFO L87 Difference]: Start difference. First operand 14169 states and 19315 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 21:15:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:25,281 INFO L93 Difference]: Finished difference Result 22989 states and 31923 transitions. [2022-07-13 21:15:25,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:25,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2022-07-13 21:15:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:25,316 INFO L225 Difference]: With dead ends: 22989 [2022-07-13 21:15:25,316 INFO L226 Difference]: Without dead ends: 13278 [2022-07-13 21:15:25,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:25,335 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 272 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 369 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 [2022-07-13 21:15:25,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 369 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:15:25,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13278 states. [2022-07-13 21:15:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13278 to 13278. [2022-07-13 21:15:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13278 states, 10936 states have (on average 1.3204096561814191) internal successors, (14440), 11085 states have internal predecessors, (14440), 1263 states have call successors, (1263), 892 states have call predecessors, (1263), 1077 states have return successors, (1782), 1310 states have call predecessors, (1782), 1259 states have call successors, (1782) [2022-07-13 21:15:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13278 states to 13278 states and 17485 transitions. [2022-07-13 21:15:26,075 INFO L78 Accepts]: Start accepts. Automaton has 13278 states and 17485 transitions. Word has length 160 [2022-07-13 21:15:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:26,076 INFO L495 AbstractCegarLoop]: Abstraction has 13278 states and 17485 transitions. [2022-07-13 21:15:26,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 21:15:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 13278 states and 17485 transitions. [2022-07-13 21:15:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-13 21:15:26,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:26,092 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:26,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 21:15:26,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:26,309 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:26,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:26,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1605594576, now seen corresponding path program 1 times [2022-07-13 21:15:26,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:26,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410339802] [2022-07-13 21:15:26,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:26,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:26,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:26,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:26,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:26,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:26,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:26,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 21:15:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:26,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 21:15:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:26,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 21:15:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:26,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 21:15:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-13 21:15:26,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:26,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410339802] [2022-07-13 21:15:26,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410339802] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:26,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127618656] [2022-07-13 21:15:26,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:26,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:26,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:26,396 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) [2022-07-13 21:15:26,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 21:15:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:26,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 21:15:26,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 21:15:26,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:26,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127618656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:26,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:26,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:15:26,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114534387] [2022-07-13 21:15:26,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:26,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:26,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:26,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:26,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:26,525 INFO L87 Difference]: Start difference. First operand 13278 states and 17485 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) [2022-07-13 21:15:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:27,210 INFO L93 Difference]: Finished difference Result 22874 states and 30536 transitions. [2022-07-13 21:15:27,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:27,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 160 [2022-07-13 21:15:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:27,254 INFO L225 Difference]: With dead ends: 22874 [2022-07-13 21:15:27,254 INFO L226 Difference]: Without dead ends: 14054 [2022-07-13 21:15:27,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:27,275 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 299 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:27,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 527 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:15:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14054 states. [2022-07-13 21:15:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14054 to 13909. [2022-07-13 21:15:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13909 states, 11526 states have (on average 1.2980218636127017) internal successors, (14961), 11670 states have internal predecessors, (14961), 1262 states have call successors, (1262), 931 states have call predecessors, (1262), 1119 states have return successors, (1767), 1317 states have call predecessors, (1767), 1258 states have call successors, (1767) [2022-07-13 21:15:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13909 states to 13909 states and 17990 transitions. [2022-07-13 21:15:28,005 INFO L78 Accepts]: Start accepts. Automaton has 13909 states and 17990 transitions. Word has length 160 [2022-07-13 21:15:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:28,005 INFO L495 AbstractCegarLoop]: Abstraction has 13909 states and 17990 transitions. [2022-07-13 21:15:28,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) [2022-07-13 21:15:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 13909 states and 17990 transitions. [2022-07-13 21:15:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-13 21:15:28,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:28,022 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:28,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 21:15:28,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:28,241 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:28,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:28,242 INFO L85 PathProgramCache]: Analyzing trace with hash 522982663, now seen corresponding path program 1 times [2022-07-13 21:15:28,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:28,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721675430] [2022-07-13 21:15:28,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:28,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:28,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:28,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:28,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:28,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:28,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:28,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 21:15:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:28,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:28,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 21:15:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 21:15:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:28,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:28,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-13 21:15:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-13 21:15:28,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:28,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721675430] [2022-07-13 21:15:28,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721675430] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:28,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206266404] [2022-07-13 21:15:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:28,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:28,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:28,325 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) [2022-07-13 21:15:28,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 21:15:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:28,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:15:28,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 21:15:28,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:28,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206266404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:28,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:28,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:15:28,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329594153] [2022-07-13 21:15:28,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:28,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:28,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:28,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:28,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:28,427 INFO L87 Difference]: Start difference. First operand 13909 states and 17990 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 21:15:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:29,354 INFO L93 Difference]: Finished difference Result 31048 states and 41157 transitions. [2022-07-13 21:15:29,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:29,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2022-07-13 21:15:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:29,417 INFO L225 Difference]: With dead ends: 31048 [2022-07-13 21:15:29,417 INFO L226 Difference]: Without dead ends: 21597 [2022-07-13 21:15:29,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:29,441 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 152 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:29,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 821 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:15:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21597 states. [2022-07-13 21:15:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21597 to 21593. [2022-07-13 21:15:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21593 states, 18019 states have (on average 1.3083411954048505) internal successors, (23575), 18243 states have internal predecessors, (23575), 1917 states have call successors, (1917), 1400 states have call predecessors, (1917), 1655 states have return successors, (2930), 1967 states have call predecessors, (2930), 1913 states have call successors, (2930) [2022-07-13 21:15:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21593 states to 21593 states and 28422 transitions. [2022-07-13 21:15:30,538 INFO L78 Accepts]: Start accepts. Automaton has 21593 states and 28422 transitions. Word has length 161 [2022-07-13 21:15:30,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:30,538 INFO L495 AbstractCegarLoop]: Abstraction has 21593 states and 28422 transitions. [2022-07-13 21:15:30,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 21:15:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 21593 states and 28422 transitions. [2022-07-13 21:15:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-13 21:15:30,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:30,560 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:30,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 21:15:30,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:30,778 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:30,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:30,778 INFO L85 PathProgramCache]: Analyzing trace with hash 675676757, now seen corresponding path program 1 times [2022-07-13 21:15:30,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:30,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118150731] [2022-07-13 21:15:30,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:30,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:30,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:30,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:30,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:30,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:30,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:30,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 21:15:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:30,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 21:15:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:30,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:30,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 21:15:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:30,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:30,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-13 21:15:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-13 21:15:30,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:30,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118150731] [2022-07-13 21:15:30,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118150731] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:30,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704480676] [2022-07-13 21:15:30,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:30,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:30,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:30,847 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) [2022-07-13 21:15:30,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 21:15:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:30,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 21:15:30,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-13 21:15:30,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:30,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704480676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:30,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:30,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:15:30,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242193522] [2022-07-13 21:15:30,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:30,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:30,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:30,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:30,967 INFO L87 Difference]: Start difference. First operand 21593 states and 28422 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 21:15:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:32,730 INFO L93 Difference]: Finished difference Result 55172 states and 74382 transitions. [2022-07-13 21:15:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:32,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2022-07-13 21:15:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:32,843 INFO L225 Difference]: With dead ends: 55172 [2022-07-13 21:15:32,843 INFO L226 Difference]: Without dead ends: 38041 [2022-07-13 21:15:32,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:32,883 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 298 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:32,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 553 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:15:32,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38041 states. [2022-07-13 21:15:34,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38041 to 37835. [2022-07-13 21:15:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37835 states, 31807 states have (on average 1.3086741912157702) internal successors, (41625), 32191 states have internal predecessors, (41625), 3247 states have call successors, (3247), 2396 states have call predecessors, (3247), 2779 states have return successors, (5969), 3281 states have call predecessors, (5969), 3243 states have call successors, (5969) [2022-07-13 21:15:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37835 states to 37835 states and 50841 transitions. [2022-07-13 21:15:35,028 INFO L78 Accepts]: Start accepts. Automaton has 37835 states and 50841 transitions. Word has length 161 [2022-07-13 21:15:35,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:35,028 INFO L495 AbstractCegarLoop]: Abstraction has 37835 states and 50841 transitions. [2022-07-13 21:15:35,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 21:15:35,029 INFO L276 IsEmpty]: Start isEmpty. Operand 37835 states and 50841 transitions. [2022-07-13 21:15:35,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-13 21:15:35,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:35,064 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:35,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 21:15:35,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-13 21:15:35,279 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:35,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1567842387, now seen corresponding path program 1 times [2022-07-13 21:15:35,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:35,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573141219] [2022-07-13 21:15:35,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:35,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:35,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:35,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:35,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:35,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:35,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:35,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 21:15:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:35,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 21:15:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:35,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:35,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 21:15:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:35,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:35,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-13 21:15:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 21:15:35,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:35,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573141219] [2022-07-13 21:15:35,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573141219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:35,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:35,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 21:15:35,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775210996] [2022-07-13 21:15:35,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:35,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:15:35,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:35,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:15:35,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 21:15:35,326 INFO L87 Difference]: Start difference. First operand 37835 states and 50841 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 21:15:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:37,250 INFO L93 Difference]: Finished difference Result 67330 states and 90844 transitions. [2022-07-13 21:15:37,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:15:37,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2022-07-13 21:15:37,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:37,354 INFO L225 Difference]: With dead ends: 67330 [2022-07-13 21:15:37,354 INFO L226 Difference]: Without dead ends: 33955 [2022-07-13 21:15:37,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:15:37,398 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 433 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:37,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 663 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:15:37,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33955 states. [2022-07-13 21:15:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33955 to 31775. [2022-07-13 21:15:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31775 states, 26625 states have (on average 1.307680751173709) internal successors, (34817), 27174 states have internal predecessors, (34817), 2569 states have call successors, (2569), 1888 states have call predecessors, (2569), 2579 states have return successors, (5056), 2730 states have call predecessors, (5056), 2565 states have call successors, (5056) [2022-07-13 21:15:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31775 states to 31775 states and 42442 transitions. [2022-07-13 21:15:39,174 INFO L78 Accepts]: Start accepts. Automaton has 31775 states and 42442 transitions. Word has length 161 [2022-07-13 21:15:39,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:39,174 INFO L495 AbstractCegarLoop]: Abstraction has 31775 states and 42442 transitions. [2022-07-13 21:15:39,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 21:15:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 31775 states and 42442 transitions. [2022-07-13 21:15:39,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-13 21:15:39,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:39,204 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:39,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 21:15:39,204 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:39,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash -423691555, now seen corresponding path program 1 times [2022-07-13 21:15:39,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:39,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528428565] [2022-07-13 21:15:39,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:39,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:39,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:39,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:39,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:39,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:39,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:39,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:15:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:39,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 21:15:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:39,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:39,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 21:15:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:39,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:39,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 21:15:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-13 21:15:39,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:39,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528428565] [2022-07-13 21:15:39,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528428565] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:39,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384470958] [2022-07-13 21:15:39,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:39,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:39,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:39,449 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) [2022-07-13 21:15:39,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 21:15:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:39,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 21:15:39,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 21:15:39,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:39,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384470958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:39,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:39,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:15:39,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699277735] [2022-07-13 21:15:39,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:39,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:39,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:39,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:39,591 INFO L87 Difference]: Start difference. First operand 31775 states and 42442 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 21:15:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:41,270 INFO L93 Difference]: Finished difference Result 50520 states and 69980 transitions. [2022-07-13 21:15:41,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:41,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2022-07-13 21:15:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:41,360 INFO L225 Difference]: With dead ends: 50520 [2022-07-13 21:15:41,360 INFO L226 Difference]: Without dead ends: 31859 [2022-07-13 21:15:41,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:41,396 INFO L413 NwaCegarLoop]: 451 mSDtfsCounter, 141 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 755 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 [2022-07-13 21:15:41,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 755 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:15:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31859 states. [2022-07-13 21:15:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31859 to 31775. [2022-07-13 21:15:43,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31775 states, 26625 states have (on average 1.2862347417840376) internal successors, (34246), 27174 states have internal predecessors, (34246), 2569 states have call successors, (2569), 1888 states have call predecessors, (2569), 2579 states have return successors, (5056), 2730 states have call predecessors, (5056), 2565 states have call successors, (5056) [2022-07-13 21:15:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31775 states to 31775 states and 41871 transitions. [2022-07-13 21:15:43,135 INFO L78 Accepts]: Start accepts. Automaton has 31775 states and 41871 transitions. Word has length 163 [2022-07-13 21:15:43,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:43,135 INFO L495 AbstractCegarLoop]: Abstraction has 31775 states and 41871 transitions. [2022-07-13 21:15:43,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 21:15:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 31775 states and 41871 transitions. [2022-07-13 21:15:43,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-13 21:15:43,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:43,163 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:43,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 21:15:43,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-13 21:15:43,379 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:43,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1271742787, now seen corresponding path program 1 times [2022-07-13 21:15:43,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:43,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827102838] [2022-07-13 21:15:43,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:43,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:43,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:43,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:43,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:43,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:43,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:43,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:15:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:43,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 21:15:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:43,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:43,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 21:15:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:43,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:43,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 21:15:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-13 21:15:43,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:43,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827102838] [2022-07-13 21:15:43,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827102838] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:43,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226835152] [2022-07-13 21:15:43,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:43,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:43,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:43,450 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:15:43,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 21:15:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:43,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:15:43,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 21:15:43,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:43,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226835152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:43,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:43,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:15:43,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259890773] [2022-07-13 21:15:43,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:43,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:43,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:43,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:43,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:43,613 INFO L87 Difference]: Start difference. First operand 31775 states and 41871 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 21:15:45,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:45,175 INFO L93 Difference]: Finished difference Result 54728 states and 74324 transitions. [2022-07-13 21:15:45,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:45,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 163 [2022-07-13 21:15:45,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:45,250 INFO L225 Difference]: With dead ends: 54728 [2022-07-13 21:15:45,250 INFO L226 Difference]: Without dead ends: 30957 [2022-07-13 21:15:45,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:45,294 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 285 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:45,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 365 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:15:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30957 states. [2022-07-13 21:15:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30957 to 22939. [2022-07-13 21:15:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22939 states, 19187 states have (on average 1.2382342210871944) internal successors, (23758), 19563 states have internal predecessors, (23758), 1865 states have call successors, (1865), 1390 states have call predecessors, (1865), 1885 states have return successors, (3347), 1995 states have call predecessors, (3347), 1861 states have call successors, (3347) [2022-07-13 21:15:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22939 states to 22939 states and 28970 transitions. [2022-07-13 21:15:47,026 INFO L78 Accepts]: Start accepts. Automaton has 22939 states and 28970 transitions. Word has length 163 [2022-07-13 21:15:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:47,026 INFO L495 AbstractCegarLoop]: Abstraction has 22939 states and 28970 transitions. [2022-07-13 21:15:47,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 21:15:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 22939 states and 28970 transitions. [2022-07-13 21:15:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-13 21:15:47,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:47,041 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:47,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 21:15:47,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-13 21:15:47,255 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:47,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:47,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1192837573, now seen corresponding path program 1 times [2022-07-13 21:15:47,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:47,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734347689] [2022-07-13 21:15:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:47,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:47,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:47,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:47,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:47,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:15:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 21:15:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:47,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 21:15:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:47,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 21:15:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-13 21:15:47,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:47,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734347689] [2022-07-13 21:15:47,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734347689] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:47,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667972654] [2022-07-13 21:15:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:47,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:47,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:47,344 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:15:47,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 21:15:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:47,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 21:15:47,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 21:15:47,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:47,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667972654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:47,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:47,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-13 21:15:47,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142043300] [2022-07-13 21:15:47,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:47,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:15:47,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:47,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:15:47,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:15:47,508 INFO L87 Difference]: Start difference. First operand 22939 states and 28970 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2022-07-13 21:15:49,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:49,053 INFO L93 Difference]: Finished difference Result 41372 states and 52881 transitions. [2022-07-13 21:15:49,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 21:15:49,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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 165 [2022-07-13 21:15:49,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:49,109 INFO L225 Difference]: With dead ends: 41372 [2022-07-13 21:15:49,109 INFO L226 Difference]: Without dead ends: 22891 [2022-07-13 21:15:49,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:15:49,138 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 376 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:49,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 611 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:15:49,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22891 states. [2022-07-13 21:15:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22891 to 22891. [2022-07-13 21:15:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22891 states, 19139 states have (on average 1.2137520246616855) internal successors, (23230), 19515 states have internal predecessors, (23230), 1865 states have call successors, (1865), 1390 states have call predecessors, (1865), 1885 states have return successors, (3347), 1995 states have call predecessors, (3347), 1861 states have call successors, (3347) [2022-07-13 21:15:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22891 states to 22891 states and 28442 transitions. [2022-07-13 21:15:50,685 INFO L78 Accepts]: Start accepts. Automaton has 22891 states and 28442 transitions. Word has length 165 [2022-07-13 21:15:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:50,685 INFO L495 AbstractCegarLoop]: Abstraction has 22891 states and 28442 transitions. [2022-07-13 21:15:50,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2022-07-13 21:15:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 22891 states and 28442 transitions. [2022-07-13 21:15:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-13 21:15:50,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:50,700 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:50,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 21:15:50,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-13 21:15:50,910 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:50,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:50,911 INFO L85 PathProgramCache]: Analyzing trace with hash 100202371, now seen corresponding path program 1 times [2022-07-13 21:15:50,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:50,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797561364] [2022-07-13 21:15:50,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:50,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:50,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:50,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:50,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:50,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:50,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:50,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:15:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:50,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 21:15:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:50,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:50,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 21:15:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:50,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:50,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 21:15:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-13 21:15:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:50,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797561364] [2022-07-13 21:15:50,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797561364] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:50,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913591077] [2022-07-13 21:15:50,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:50,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:50,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:50,985 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:15:50,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 21:15:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:51,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 21:15:51,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 21:15:51,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:51,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913591077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:51,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:51,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-13 21:15:51,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343978860] [2022-07-13 21:15:51,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:51,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:15:51,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:51,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:15:51,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:15:51,135 INFO L87 Difference]: Start difference. First operand 22891 states and 28442 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2022-07-13 21:15:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:52,916 INFO L93 Difference]: Finished difference Result 40204 states and 51213 transitions. [2022-07-13 21:15:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 21:15:52,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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 165 [2022-07-13 21:15:52,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:52,970 INFO L225 Difference]: With dead ends: 40204 [2022-07-13 21:15:52,970 INFO L226 Difference]: Without dead ends: 22497 [2022-07-13 21:15:52,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-13 21:15:52,998 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 403 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:52,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 623 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:15:53,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22497 states. [2022-07-13 21:15:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22497 to 20464. [2022-07-13 21:15:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20464 states, 17096 states have (on average 1.1868858212447355) internal successors, (20291), 17424 states have internal predecessors, (20291), 1673 states have call successors, (1673), 1250 states have call predecessors, (1673), 1693 states have return successors, (2867), 1795 states have call predecessors, (2867), 1669 states have call successors, (2867) [2022-07-13 21:15:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20464 states to 20464 states and 24831 transitions. [2022-07-13 21:15:54,400 INFO L78 Accepts]: Start accepts. Automaton has 20464 states and 24831 transitions. Word has length 165 [2022-07-13 21:15:54,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:54,400 INFO L495 AbstractCegarLoop]: Abstraction has 20464 states and 24831 transitions. [2022-07-13 21:15:54,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2022-07-13 21:15:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 20464 states and 24831 transitions. [2022-07-13 21:15:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-13 21:15:54,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:54,410 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:54,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-13 21:15:54,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-13 21:15:54,611 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:54,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:54,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1742273343, now seen corresponding path program 1 times [2022-07-13 21:15:54,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:54,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956459894] [2022-07-13 21:15:54,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:54,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:54,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:54,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:54,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:54,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:15:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 21:15:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:54,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:54,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 21:15:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:54,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:54,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 21:15:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-13 21:15:54,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:54,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956459894] [2022-07-13 21:15:54,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956459894] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:54,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482872200] [2022-07-13 21:15:54,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:54,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:54,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:54,683 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:15:54,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 21:15:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:54,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 21:15:54,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-13 21:15:54,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:54,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482872200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:54,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:54,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-13 21:15:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206138979] [2022-07-13 21:15:54,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:54,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:15:54,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:54,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:15:54,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:15:54,813 INFO L87 Difference]: Start difference. First operand 20464 states and 24831 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2022-07-13 21:15:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:56,139 INFO L93 Difference]: Finished difference Result 36204 states and 44667 transitions. [2022-07-13 21:15:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 21:15:56,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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 165 [2022-07-13 21:15:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:56,191 INFO L225 Difference]: With dead ends: 36204 [2022-07-13 21:15:56,191 INFO L226 Difference]: Without dead ends: 20200 [2022-07-13 21:15:56,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:15:56,223 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 49 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1314 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 [2022-07-13 21:15:56,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1314 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:15:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20200 states. [2022-07-13 21:15:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20200 to 19820. [2022-07-13 21:15:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19820 states, 16477 states have (on average 1.171997329610973) internal successors, (19311), 16788 states have internal predecessors, (19311), 1673 states have call successors, (1673), 1250 states have call predecessors, (1673), 1668 states have return successors, (2727), 1787 states have call predecessors, (2727), 1669 states have call successors, (2727) [2022-07-13 21:15:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19820 states to 19820 states and 23711 transitions. [2022-07-13 21:15:57,711 INFO L78 Accepts]: Start accepts. Automaton has 19820 states and 23711 transitions. Word has length 165 [2022-07-13 21:15:57,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:57,712 INFO L495 AbstractCegarLoop]: Abstraction has 19820 states and 23711 transitions. [2022-07-13 21:15:57,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2022-07-13 21:15:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 19820 states and 23711 transitions. [2022-07-13 21:15:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-13 21:15:57,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:57,722 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:57,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 21:15:57,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:57,923 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:57,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:57,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1910661765, now seen corresponding path program 1 times [2022-07-13 21:15:57,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:57,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432502422] [2022-07-13 21:15:57,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:57,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:57,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:57,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:57,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:15:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:57,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:15:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:57,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:15:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:57,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:15:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:57,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 21:15:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:57,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:57,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 21:15:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:57,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:57,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 21:15:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-13 21:15:57,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:57,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432502422] [2022-07-13 21:15:57,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432502422] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:57,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743011128] [2022-07-13 21:15:57,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:57,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:57,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:57,985 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:15:57,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 21:15:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:58,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 21:15:58,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-13 21:15:58,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:58,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743011128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:58,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:58,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-13 21:15:58,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108404916] [2022-07-13 21:15:58,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:58,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:15:58,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:58,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:15:58,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:15:58,099 INFO L87 Difference]: Start difference. First operand 19820 states and 23711 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2022-07-13 21:15:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:59,188 INFO L93 Difference]: Finished difference Result 29556 states and 35690 transitions. [2022-07-13 21:15:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 21:15:59,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 165 [2022-07-13 21:15:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:59,223 INFO L225 Difference]: With dead ends: 29556 [2022-07-13 21:15:59,223 INFO L226 Difference]: Without dead ends: 14193 [2022-07-13 21:15:59,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:15:59,248 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 10 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1299 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 [2022-07-13 21:15:59,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1299 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:15:59,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14193 states. [2022-07-13 21:16:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14193 to 14137. [2022-07-13 21:16:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14137 states, 11744 states have (on average 1.1673194822888284) internal successors, (13709), 11906 states have internal predecessors, (13709), 1230 states have call successors, (1230), 914 states have call predecessors, (1230), 1161 states have return successors, (1768), 1320 states have call predecessors, (1768), 1226 states have call successors, (1768) [2022-07-13 21:16:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14137 states to 14137 states and 16707 transitions. [2022-07-13 21:16:00,238 INFO L78 Accepts]: Start accepts. Automaton has 14137 states and 16707 transitions. Word has length 165 [2022-07-13 21:16:00,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:16:00,238 INFO L495 AbstractCegarLoop]: Abstraction has 14137 states and 16707 transitions. [2022-07-13 21:16:00,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2022-07-13 21:16:00,238 INFO L276 IsEmpty]: Start isEmpty. Operand 14137 states and 16707 transitions. [2022-07-13 21:16:00,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-13 21:16:00,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:16:00,245 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:16:00,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-13 21:16:00,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:16:00,462 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:16:00,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:16:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1582737387, now seen corresponding path program 1 times [2022-07-13 21:16:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:16:00,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500800088] [2022-07-13 21:16:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:16:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:16:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:16:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:16:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:16:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:16:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:16:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 21:16:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 21:16:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 21:16:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 21:16:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 21:16:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 21:16:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:16:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:16:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 21:16:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 21:16:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 21:16:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:16:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:16:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 21:16:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-13 21:16:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-13 21:16:00,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:16:00,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500800088] [2022-07-13 21:16:00,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500800088] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:16:00,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723331947] [2022-07-13 21:16:00,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:16:00,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:16:00,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:16:00,551 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:16:00,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 21:16:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:00,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:16:00,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:16:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 21:16:00,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:16:00,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723331947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:16:00,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:16:00,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-13 21:16:00,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98590622] [2022-07-13 21:16:00,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:16:00,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:16:00,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:16:00,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:16:00,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:16:00,780 INFO L87 Difference]: Start difference. First operand 14137 states and 16707 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 21:16:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:16:01,852 INFO L93 Difference]: Finished difference Result 23005 states and 27445 transitions. [2022-07-13 21:16:01,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:16:01,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 195 [2022-07-13 21:16:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:16:01,886 INFO L225 Difference]: With dead ends: 23005 [2022-07-13 21:16:01,886 INFO L226 Difference]: Without dead ends: 18571 [2022-07-13 21:16:01,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:16:01,896 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 52 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:16:01,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 645 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:16:01,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18571 states. [2022-07-13 21:16:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18571 to 18561. [2022-07-13 21:16:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18561 states, 15181 states have (on average 1.1741650747645083) internal successors, (17825), 15403 states have internal predecessors, (17825), 1730 states have call successors, (1730), 1278 states have call predecessors, (1730), 1648 states have return successors, (2461), 1883 states have call predecessors, (2461), 1726 states have call successors, (2461) [2022-07-13 21:16:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18561 states to 18561 states and 22016 transitions. [2022-07-13 21:16:03,030 INFO L78 Accepts]: Start accepts. Automaton has 18561 states and 22016 transitions. Word has length 195 [2022-07-13 21:16:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:16:03,031 INFO L495 AbstractCegarLoop]: Abstraction has 18561 states and 22016 transitions. [2022-07-13 21:16:03,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 21:16:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 18561 states and 22016 transitions. [2022-07-13 21:16:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-13 21:16:03,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:16:03,040 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:16:03,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 21:16:03,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:16:03,241 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:16:03,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:16:03,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1814836631, now seen corresponding path program 1 times [2022-07-13 21:16:03,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:16:03,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905369609] [2022-07-13 21:16:03,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:16:03,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:16:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:16:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:16:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:16:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:16:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:16:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 21:16:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 21:16:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 21:16:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 21:16:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 21:16:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 21:16:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:16:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:16:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 21:16:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 21:16:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 21:16:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:16:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:16:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 21:16:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-13 21:16:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-13 21:16:03,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:16:03,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905369609] [2022-07-13 21:16:03,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905369609] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:16:03,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725121620] [2022-07-13 21:16:03,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:16:03,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:16:03,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:16:03,326 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:16:03,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 21:16:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:03,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:16:03,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:16:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-13 21:16:03,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:16:03,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725121620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:16:03,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:16:03,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-13 21:16:03,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291172097] [2022-07-13 21:16:03,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:16:03,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:16:03,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:16:03,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:16:03,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:16:03,585 INFO L87 Difference]: Start difference. First operand 18561 states and 22016 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-13 21:16:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:16:04,695 INFO L93 Difference]: Finished difference Result 25091 states and 30256 transitions. [2022-07-13 21:16:04,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:16:04,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 195 [2022-07-13 21:16:04,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:16:04,719 INFO L225 Difference]: With dead ends: 25091 [2022-07-13 21:16:04,719 INFO L226 Difference]: Without dead ends: 9692 [2022-07-13 21:16:04,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:16:04,742 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:16:04,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 311 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:16:04,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9692 states. [2022-07-13 21:16:05,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9692 to 9692. [2022-07-13 21:16:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9692 states, 8295 states have (on average 1.1487643158529235) internal successors, (9529), 8394 states have internal predecessors, (9529), 722 states have call successors, (722), 549 states have call predecessors, (722), 674 states have return successors, (1068), 750 states have call predecessors, (1068), 720 states have call successors, (1068) [2022-07-13 21:16:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9692 states to 9692 states and 11319 transitions. [2022-07-13 21:16:05,527 INFO L78 Accepts]: Start accepts. Automaton has 9692 states and 11319 transitions. Word has length 195 [2022-07-13 21:16:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:16:05,527 INFO L495 AbstractCegarLoop]: Abstraction has 9692 states and 11319 transitions. [2022-07-13 21:16:05,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-13 21:16:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 9692 states and 11319 transitions. [2022-07-13 21:16:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-13 21:16:05,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:16:05,535 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:16:05,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 21:16:05,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-13 21:16:05,746 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:16:05,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:16:05,746 INFO L85 PathProgramCache]: Analyzing trace with hash -55403990, now seen corresponding path program 1 times [2022-07-13 21:16:05,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:16:05,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542465697] [2022-07-13 21:16:05,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:16:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:16:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:16:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:16:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:16:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:16:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:16:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 21:16:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:16:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 21:16:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 21:16:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:16:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 21:16:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:16:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-13 21:16:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-13 21:16:05,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:16:05,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542465697] [2022-07-13 21:16:05,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542465697] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:16:05,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476827316] [2022-07-13 21:16:05,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:16:05,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:16:05,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:16:05,812 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:16:05,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 21:16:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:05,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:16:05,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:16:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 21:16:05,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:16:05,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476827316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:16:05,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:16:05,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:16:05,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124224930] [2022-07-13 21:16:05,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:16:05,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:16:05,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:16:05,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:16:05,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:16:05,930 INFO L87 Difference]: Start difference. First operand 9692 states and 11319 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 21:16:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:16:06,242 INFO L93 Difference]: Finished difference Result 12798 states and 14928 transitions. [2022-07-13 21:16:06,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:16:06,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 200 [2022-07-13 21:16:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:16:06,249 INFO L225 Difference]: With dead ends: 12798 [2022-07-13 21:16:06,249 INFO L226 Difference]: Without dead ends: 2922 [2022-07-13 21:16:06,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:16:06,261 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 138 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:16:06,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 426 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:16:06,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-07-13 21:16:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2022-07-13 21:16:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2482 states have (on average 1.128928283642224) internal successors, (2802), 2504 states have internal predecessors, (2802), 247 states have call successors, (247), 176 states have call predecessors, (247), 192 states have return successors, (282), 243 states have call predecessors, (282), 245 states have call successors, (282) [2022-07-13 21:16:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3331 transitions. [2022-07-13 21:16:06,447 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3331 transitions. Word has length 200 [2022-07-13 21:16:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:16:06,447 INFO L495 AbstractCegarLoop]: Abstraction has 2922 states and 3331 transitions. [2022-07-13 21:16:06,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 21:16:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3331 transitions. [2022-07-13 21:16:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-13 21:16:06,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:16:06,450 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:16:06,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-13 21:16:06,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:16:06,650 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:16:06,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:16:06,651 INFO L85 PathProgramCache]: Analyzing trace with hash 135104874, now seen corresponding path program 1 times [2022-07-13 21:16:06,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:16:06,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429034319] [2022-07-13 21:16:06,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:16:06,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:16:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:16:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:16:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:16:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:16:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:16:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 21:16:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 21:16:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:16:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:16:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:16:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-13 21:16:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:16:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-13 21:16:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 53 proven. 41 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-13 21:16:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:16:06,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429034319] [2022-07-13 21:16:06,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429034319] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:16:06,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602744904] [2022-07-13 21:16:06,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:16:06,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:16:06,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:16:06,745 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:16:06,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-13 21:16:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:06,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 21:16:06,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:16:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 21:16:06,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:16:06,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602744904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:16:06,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:16:06,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-07-13 21:16:06,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254162269] [2022-07-13 21:16:06,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:16:06,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:16:06,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:16:06,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:16:06,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:16:06,891 INFO L87 Difference]: Start difference. First operand 2922 states and 3331 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 21:16:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:16:07,070 INFO L93 Difference]: Finished difference Result 5145 states and 5903 transitions. [2022-07-13 21:16:07,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:16:07,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 201 [2022-07-13 21:16:07,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:16:07,075 INFO L225 Difference]: With dead ends: 5145 [2022-07-13 21:16:07,075 INFO L226 Difference]: Without dead ends: 2922 [2022-07-13 21:16:07,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:16:07,079 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 106 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:16:07,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 379 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:16:07,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-07-13 21:16:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2022-07-13 21:16:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2482 states have (on average 1.1180499597099114) internal successors, (2775), 2504 states have internal predecessors, (2775), 247 states have call successors, (247), 176 states have call predecessors, (247), 192 states have return successors, (282), 243 states have call predecessors, (282), 245 states have call successors, (282) [2022-07-13 21:16:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3304 transitions. [2022-07-13 21:16:07,269 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3304 transitions. Word has length 201 [2022-07-13 21:16:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:16:07,269 INFO L495 AbstractCegarLoop]: Abstraction has 2922 states and 3304 transitions. [2022-07-13 21:16:07,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 21:16:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3304 transitions. [2022-07-13 21:16:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-13 21:16:07,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:16:07,272 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:16:07,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-13 21:16:07,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:16:07,472 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:16:07,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:16:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash 171826558, now seen corresponding path program 1 times [2022-07-13 21:16:07,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:16:07,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229173397] [2022-07-13 21:16:07,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:16:07,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:16:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:07,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:16:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:07,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:16:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:07,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:16:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:07,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:16:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:07,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:16:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:07,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 21:16:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:07,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 21:16:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:07,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:16:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:07,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:16:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:07,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:16:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:07,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 21:16:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:16:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:07,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 21:16:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-13 21:16:07,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:16:07,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229173397] [2022-07-13 21:16:07,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229173397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:16:07,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:16:07,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:16:07,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705286004] [2022-07-13 21:16:07,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:16:07,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:16:07,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:16:07,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:16:07,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:16:07,570 INFO L87 Difference]: Start difference. First operand 2922 states and 3304 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 21:16:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:16:08,362 INFO L93 Difference]: Finished difference Result 3320 states and 3736 transitions. [2022-07-13 21:16:08,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:16:08,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2022-07-13 21:16:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:16:08,368 INFO L225 Difference]: With dead ends: 3320 [2022-07-13 21:16:08,369 INFO L226 Difference]: Without dead ends: 3317 [2022-07-13 21:16:08,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-07-13 21:16:08,370 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 688 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 21:16:08,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 927 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 21:16:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-07-13 21:16:08,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3086. [2022-07-13 21:16:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 2621 states have (on average 1.1175123998473866) internal successors, (2929), 2643 states have internal predecessors, (2929), 261 states have call successors, (261), 186 states have call predecessors, (261), 203 states have return successors, (298), 258 states have call predecessors, (298), 260 states have call successors, (298) [2022-07-13 21:16:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 3488 transitions. [2022-07-13 21:16:08,591 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 3488 transitions. Word has length 203 [2022-07-13 21:16:08,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:16:08,592 INFO L495 AbstractCegarLoop]: Abstraction has 3086 states and 3488 transitions. [2022-07-13 21:16:08,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 21:16:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 3488 transitions. [2022-07-13 21:16:08,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-13 21:16:08,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:16:08,596 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:16:08,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-13 21:16:08,596 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:16:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:16:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash -190863834, now seen corresponding path program 1 times [2022-07-13 21:16:08,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:16:08,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494556133] [2022-07-13 21:16:08,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:16:08,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:16:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:08,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:16:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:08,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:16:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:08,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:16:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:08,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 21:16:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 21:16:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:08,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 21:16:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:08,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 21:16:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:16:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:08,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:16:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:08,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:16:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:08,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 21:16:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:16:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:08,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 21:16:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:16:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-07-13 21:16:08,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:16:08,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494556133] [2022-07-13 21:16:08,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494556133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:16:08,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:16:08,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 21:16:08,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457156536] [2022-07-13 21:16:08,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:16:08,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:16:08,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:16:08,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:16:08,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 21:16:08,652 INFO L87 Difference]: Start difference. First operand 3086 states and 3488 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 21:16:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:16:09,163 INFO L93 Difference]: Finished difference Result 5135 states and 5909 transitions. [2022-07-13 21:16:09,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 21:16:09,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2022-07-13 21:16:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:16:09,172 INFO L225 Difference]: With dead ends: 5135 [2022-07-13 21:16:09,172 INFO L226 Difference]: Without dead ends: 3747 [2022-07-13 21:16:09,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:16:09,175 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 197 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:16:09,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 568 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:16:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2022-07-13 21:16:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 3089. [2022-07-13 21:16:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3089 states, 2624 states have (on average 1.1173780487804879) internal successors, (2932), 2646 states have internal predecessors, (2932), 261 states have call successors, (261), 186 states have call predecessors, (261), 203 states have return successors, (298), 258 states have call predecessors, (298), 260 states have call successors, (298) [2022-07-13 21:16:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 3491 transitions. [2022-07-13 21:16:09,402 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 3491 transitions. Word has length 207 [2022-07-13 21:16:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:16:09,402 INFO L495 AbstractCegarLoop]: Abstraction has 3089 states and 3491 transitions. [2022-07-13 21:16:09,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 21:16:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 3491 transitions. [2022-07-13 21:16:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-13 21:16:09,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:16:09,406 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:16:09,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-13 21:16:09,406 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:16:09,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:16:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash -392769361, now seen corresponding path program 1 times [2022-07-13 21:16:09,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:16:09,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714269832] [2022-07-13 21:16:09,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:16:09,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:16:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:16:09,418 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:16:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:16:09,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:16:09,490 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:16:09,491 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-13 21:16:09,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-13 21:16:09,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-13 21:16:09,495 INFO L356 BasicCegarLoop]: Path program 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] [2022-07-13 21:16:09,499 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:16:09,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:16:09 BoogieIcfgContainer [2022-07-13 21:16:09,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:16:09,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:16:09,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:16:09,658 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:16:09,659 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:15:02" (3/4) ... [2022-07-13 21:16:09,660 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:16:09,788 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:16:09,788 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:16:09,788 INFO L158 Benchmark]: Toolchain (without parser) took 68431.59ms. Allocated memory was 86.0MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 49.2MB in the beginning and 6.3GB in the end (delta: -6.3GB). Peak memory consumption was 925.0MB. Max. memory is 16.1GB. [2022-07-13 21:16:09,791 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 86.0MB. Free memory was 66.3MB in the beginning and 66.3MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:16:09,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.84ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 49.0MB in the beginning and 78.6MB in the end (delta: -29.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 21:16:09,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.49ms. Allocated memory is still 109.1MB. Free memory was 78.6MB in the beginning and 75.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 21:16:09,792 INFO L158 Benchmark]: Boogie Preprocessor took 28.14ms. Allocated memory is still 109.1MB. Free memory was 75.6MB in the beginning and 73.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:16:09,793 INFO L158 Benchmark]: RCFGBuilder took 519.63ms. Allocated memory is still 109.1MB. Free memory was 73.1MB in the beginning and 45.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-13 21:16:09,794 INFO L158 Benchmark]: TraceAbstraction took 67370.00ms. Allocated memory was 109.1MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 45.1MB in the beginning and 6.3GB in the end (delta: -6.3GB). Peak memory consumption was 872.5MB. Max. memory is 16.1GB. [2022-07-13 21:16:09,794 INFO L158 Benchmark]: Witness Printer took 129.94ms. Allocated memory is still 7.3GB. Free memory was 6.3GB in the beginning and 6.3GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-13 21:16:09,795 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.10ms. Allocated memory is still 86.0MB. Free memory was 66.3MB in the beginning and 66.3MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.84ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 49.0MB in the beginning and 78.6MB in the end (delta: -29.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.49ms. Allocated memory is still 109.1MB. Free memory was 78.6MB in the beginning and 75.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.14ms. Allocated memory is still 109.1MB. Free memory was 75.6MB in the beginning and 73.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 519.63ms. Allocated memory is still 109.1MB. Free memory was 73.1MB in the beginning and 45.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 67370.00ms. Allocated memory was 109.1MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 45.1MB in the beginning and 6.3GB in the end (delta: -6.3GB). Peak memory consumption was 872.5MB. Max. memory is 16.1GB. * Witness Printer took 129.94ms. Allocated memory is still 7.3GB. Free memory was 6.3GB in the beginning and 6.3GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int t2_pc = 0; [L606] int m_st ; [L607] int t1_st ; [L608] int t2_st ; [L609] int m_i ; [L610] int t1_i ; [L611] int t2_i ; [L612] int M_E = 2; [L613] int T1_E = 2; [L614] int T2_E = 2; [L615] int E_M = 2; [L616] int E_1 = 2; [L617] int E_2 = 2; [L622] int token ; [L624] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L1202] COND FALSE !(__VERIFIER_nondet_int()) [L1205] CALL main2() [L1189] int __retres1 ; [L1193] CALL init_model2() [L1103] m_i = 1 [L1104] t1_i = 1 [L1105] t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1193] RET init_model2() [L1194] CALL start_simulation2() [L1130] int kernel_st ; [L1131] int tmp ; [L1132] int tmp___0 ; [L1136] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1137] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1138] CALL init_threads2() [L822] COND TRUE m_i == 1 [L823] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L827] COND TRUE t1_i == 1 [L828] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L832] COND TRUE t2_i == 1 [L833] t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1138] RET init_threads2() [L1139] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L935] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L940] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L945] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L950] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L955] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L960] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1139] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1140] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L757] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L767] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L776] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L786] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L788] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L795] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L805] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L807] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1140] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1141] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L973] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L978] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L983] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L988] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L993] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L998] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1141] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1144] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1147] kernel_st = 1 [L1148] CALL eval2() [L868] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L872] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L842] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L845] COND TRUE m_st == 0 [L846] __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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L863] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] 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_2=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] tmp = exists_runnable_thread2() [L877] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L896] COND TRUE t1_st == 0 [L897] int tmp_ndt_2; [L898] tmp_ndt_2 = __VERIFIER_nondet_int() [L899] COND TRUE \read(tmp_ndt_2) [L901] t1_st = 1 [L902] CALL transmit1() [L685] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L696] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L698] t1_pc = 1 [L699] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L902] RET transmit1() [L910] COND TRUE t2_st == 0 [L911] int tmp_ndt_3; [L912] tmp_ndt_3 = __VERIFIER_nondet_int() [L913] COND TRUE \read(tmp_ndt_3) [L915] t2_st = 1 [L916] CALL transmit2() [L721] COND TRUE t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L732] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L734] t2_pc = 1 [L735] t2_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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L916] RET transmit2() [L872] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, token=0] [L875] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L842] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L845] COND TRUE m_st == 0 [L846] __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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L863] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L875] 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_2=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, token=0] [L875] tmp = exists_runnable_thread2() [L877] 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_2=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, token=0] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp_ndt_1) [L887] m_st = 1 [L888] CALL master() [L627] int tmp_var = __VERIFIER_nondet_int(); [L629] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L640] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L643] token = __VERIFIER_nondet_int() [L644] local = token [L645] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L646] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1046] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L757] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L767] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L769] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L777] COND TRUE E_1 == 1 [L778] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L788] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND TRUE \read(tmp___0) [L1025] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L796] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L805] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L807] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L1046] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L646] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L647] E_1 = 2 [L648] m_pc = 1 [L649] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L888] RET master() [L896] COND TRUE t1_st == 0 [L897] int tmp_ndt_2; [L898] tmp_ndt_2 = __VERIFIER_nondet_int() [L899] COND TRUE \read(tmp_ndt_2) [L901] t1_st = 1 [L902] CALL transmit1() [L685] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L688] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L704] token += 1 [L705] E_2 = 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_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L706] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1046] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L757] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L758] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L767] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L769] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L777] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L786] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L788] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L796] COND TRUE E_2 == 1 [L797] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L807] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND TRUE \read(tmp___1) [L1033] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L1046] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L706] 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_2=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L707] E_2 = 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L696] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L698] t1_pc = 1 [L699] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L902] RET transmit1() [L910] COND TRUE t2_st == 0 [L911] int tmp_ndt_3; [L912] tmp_ndt_3 = __VERIFIER_nondet_int() [L913] COND TRUE \read(tmp_ndt_3) [L915] t2_st = 1 [L916] CALL transmit2() [L721] COND FALSE !(t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L724] COND TRUE t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L740] token += 1 [L741] 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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L742] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1046] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L757] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L758] COND TRUE E_M == 1 [L759] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L769] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND TRUE \read(tmp) [L1017] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L777] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L786] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L788] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L796] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L805] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L807] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L1046] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L742] 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_2=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L743] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L732] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L734] t2_pc = 1 [L735] t2_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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L916] RET transmit2() [L872] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=4, tmp_ndt_3=-4, token=2] [L875] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L842] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L845] COND TRUE m_st == 0 [L846] __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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L863] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L875] 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_2=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=4, tmp_ndt_3=-4, token=2] [L875] tmp = exists_runnable_thread2() [L877] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=4, tmp_ndt_3=-4, token=2] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp_ndt_1) [L887] m_st = 1 [L888] CALL master() [L627] int tmp_var = __VERIFIER_nondet_int(); [L629] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L632] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L654] COND FALSE !(token != local + 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L659] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L660] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L665] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L666] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L667] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L668] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L599] 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_2=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 27]: 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, 257 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 67.2s, OverallIterations: 38, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 34.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19745 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19363 mSDsluCounter, 33741 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20295 mSDsCounter, 4037 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15991 IncrementalHoareTripleChecker+Invalid, 20028 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4037 mSolverCounterUnsat, 13446 mSDtfsCounter, 15991 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4190 GetRequests, 3762 SyntacticMatches, 6 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37835occurred in iteration=24, InterpolantAutomatonStates: 342, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 17467 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 7938 NumberOfCodeBlocks, 7938 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 7675 ConstructedInterpolants, 0 QuantifiedInterpolants, 13803 SizeOfPredicates, 6 NumberOfNonLiveVariables, 10138 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 55 InterpolantComputations, 37 PerfectInterpolantSequences, 4071/4403 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! [2022-07-13 21:16:09,837 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