./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.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.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:14:51,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:14:51,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:14:51,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:14:51,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:14:51,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:14:51,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:14:51,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:14:51,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:14:51,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:14:51,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:14:51,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:14:51,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:14:51,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:14:51,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:14:51,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:14:51,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:14:51,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:14:51,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:14:51,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:14:51,178 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:14:51,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:14:51,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:14:51,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:14:51,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:14:51,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:14:51,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:14:51,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:14:51,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:14:51,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:14:51,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:14:51,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:14:51,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:14:51,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:14:51,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:14:51,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:14:51,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:14:51,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:14:51,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:14:51,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:14:51,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:14:51,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:14:51,197 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:14:51,226 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:14:51,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:14:51,227 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:14:51,227 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:14:51,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:14:51,228 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:14:51,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:14:51,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:14:51,229 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:14:51,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:14:51,230 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:14:51,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:14:51,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:14:51,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:14:51,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:14:51,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:14:51,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:14:51,231 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:14:51,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:14:51,232 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:14:51,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:14:51,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:14:51,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:14:51,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:14:51,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:14:51,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:14:51,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:14:51,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:14:51,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:14:51,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:14:51,234 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:14:51,234 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:14:51,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:14:51,235 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 -> 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c [2022-07-13 21:14:51,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:14:51,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:14:51,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:14:51,515 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:14:51,516 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:14:51,517 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.01.cil-2.c [2022-07-13 21:14:51,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b42e06bbf/ce7e38a9511b4c2287b298fec4bf44f9/FLAGf7e2a8b9f [2022-07-13 21:14:52,055 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:14:52,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2022-07-13 21:14:52,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b42e06bbf/ce7e38a9511b4c2287b298fec4bf44f9/FLAGf7e2a8b9f [2022-07-13 21:14:52,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b42e06bbf/ce7e38a9511b4c2287b298fec4bf44f9 [2022-07-13 21:14:52,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:14:52,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:14:52,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:14:52,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:14:52,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:14:52,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:14:52" (1/1) ... [2022-07-13 21:14:52,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403b0be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:52, skipping insertion in model container [2022-07-13 21:14:52,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:14:52" (1/1) ... [2022-07-13 21:14:52,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:14:52,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:14:52,659 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.01.cil-2.c[911,924] [2022-07-13 21:14:52,737 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.01.cil-2.c[8416,8429] [2022-07-13 21:14:52,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:14:52,776 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:14:52,789 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.01.cil-2.c[911,924] [2022-07-13 21:14:52,822 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.01.cil-2.c[8416,8429] [2022-07-13 21:14:52,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:14:52,887 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:14:52,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:52 WrapperNode [2022-07-13 21:14:52,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:14:52,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:14:52,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:14:52,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:14:52,897 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:14:52" (1/1) ... [2022-07-13 21:14:52,921 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:14:52" (1/1) ... [2022-07-13 21:14:52,951 INFO L137 Inliner]: procedures = 57, calls = 65, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 445 [2022-07-13 21:14:52,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:14:52,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:14:52,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:14:52,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:14:52,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:52" (1/1) ... [2022-07-13 21:14:52,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:52" (1/1) ... [2022-07-13 21:14:52,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:52" (1/1) ... [2022-07-13 21:14:52,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:52" (1/1) ... [2022-07-13 21:14:52,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:52" (1/1) ... [2022-07-13 21:14:53,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:52" (1/1) ... [2022-07-13 21:14:53,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:52" (1/1) ... [2022-07-13 21:14:53,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:14:53,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:14:53,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:14:53,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:14:53,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:52" (1/1) ... [2022-07-13 21:14:53,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:14:53,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:14:53,061 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:14:53,086 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:14:53,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:14:53,103 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-13 21:14:53,104 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-13 21:14:53,104 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-13 21:14:53,105 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-13 21:14:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-13 21:14:53,106 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-13 21:14:53,106 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-13 21:14:53,106 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-13 21:14:53,106 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-13 21:14:53,106 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-13 21:14:53,106 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-13 21:14:53,106 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-13 21:14:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-13 21:14:53,107 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-13 21:14:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-13 21:14:53,107 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-13 21:14:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-13 21:14:53,107 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-13 21:14:53,108 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-13 21:14:53,108 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-13 21:14:53,108 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-13 21:14:53,108 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-13 21:14:53,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:14:53,108 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-13 21:14:53,108 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-13 21:14:53,109 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-13 21:14:53,109 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-13 21:14:53,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:14:53,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:14:53,109 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-13 21:14:53,109 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-13 21:14:53,110 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-07-13 21:14:53,110 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-07-13 21:14:53,230 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:14:53,232 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:14:53,657 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-07-13 21:14:53,657 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:14:53,709 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:14:53,727 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:14:53,727 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-13 21:14:53,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:14:53 BoogieIcfgContainer [2022-07-13 21:14:53,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:14:53,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:14:53,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:14:53,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:14:53,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:14:52" (1/3) ... [2022-07-13 21:14:53,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da29cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:14:53, skipping insertion in model container [2022-07-13 21:14:53,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:52" (2/3) ... [2022-07-13 21:14:53,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da29cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:14:53, skipping insertion in model container [2022-07-13 21:14:53,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:14:53" (3/3) ... [2022-07-13 21:14:53,743 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-2.c [2022-07-13 21:14:53,757 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:14:53,757 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:14:53,805 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:14:53,811 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@6df4dad7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c43f3b9 [2022-07-13 21:14:53,811 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-13 21:14:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 181 states have (on average 1.5469613259668509) internal successors, (280), 189 states have internal predecessors, (280), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2022-07-13 21:14:53,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 21:14:53,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:53,829 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] [2022-07-13 21:14:53,829 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:53,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:53,834 INFO L85 PathProgramCache]: Analyzing trace with hash 560703049, now seen corresponding path program 1 times [2022-07-13 21:14:53,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:53,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927725017] [2022-07-13 21:14:53,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:53,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:54,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:54,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:14:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:54,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:14:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:54,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:14:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:54,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:14:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:54,193 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:14:54,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:54,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927725017] [2022-07-13 21:14:54,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927725017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:54,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:54,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:14:54,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632648374] [2022-07-13 21:14:54,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:54,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:14:54,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:54,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:14:54,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:14:54,228 INFO L87 Difference]: Start difference. First operand has 232 states, 181 states have (on average 1.5469613259668509) internal successors, (280), 189 states have internal predecessors, (280), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:14:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:55,098 INFO L93 Difference]: Finished difference Result 584 states and 884 transitions. [2022-07-13 21:14:55,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:14:55,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-07-13 21:14:55,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:55,123 INFO L225 Difference]: With dead ends: 584 [2022-07-13 21:14:55,123 INFO L226 Difference]: Without dead ends: 359 [2022-07-13 21:14:55,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:14:55,135 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 572 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:55,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 862 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 21:14:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-07-13 21:14:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 316. [2022-07-13 21:14:55,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 251 states have (on average 1.4621513944223108) internal successors, (367), 257 states have internal predecessors, (367), 43 states have call successors, (43), 21 states have call predecessors, (43), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-07-13 21:14:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 452 transitions. [2022-07-13 21:14:55,203 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 452 transitions. Word has length 58 [2022-07-13 21:14:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:55,204 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 452 transitions. [2022-07-13 21:14:55,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:14:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 452 transitions. [2022-07-13 21:14:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 21:14:55,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:55,208 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] [2022-07-13 21:14:55,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:14:55,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:55,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1940005051, now seen corresponding path program 1 times [2022-07-13 21:14:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:55,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474091236] [2022-07-13 21:14:55,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:55,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:55,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:14:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:55,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:14:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:55,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:14:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:55,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:14:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:55,344 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:14:55,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:55,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474091236] [2022-07-13 21:14:55,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474091236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:55,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:55,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:14:55,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233114148] [2022-07-13 21:14:55,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:55,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:14:55,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:55,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:14:55,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:14:55,352 INFO L87 Difference]: Start difference. First operand 316 states and 452 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:14:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:56,186 INFO L93 Difference]: Finished difference Result 667 states and 960 transitions. [2022-07-13 21:14:56,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:14:56,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-07-13 21:14:56,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:56,194 INFO L225 Difference]: With dead ends: 667 [2022-07-13 21:14:56,194 INFO L226 Difference]: Without dead ends: 472 [2022-07-13 21:14:56,198 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:14:56,200 INFO L413 NwaCegarLoop]: 386 mSDtfsCounter, 547 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:56,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1212 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 21:14:56,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-13 21:14:56,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 406. [2022-07-13 21:14:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 324 states have (on average 1.4567901234567902) internal successors, (472), 331 states have internal predecessors, (472), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-07-13 21:14:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 579 transitions. [2022-07-13 21:14:56,261 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 579 transitions. Word has length 58 [2022-07-13 21:14:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:56,261 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 579 transitions. [2022-07-13 21:14:56,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:14:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 579 transitions. [2022-07-13 21:14:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 21:14:56,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:56,271 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] [2022-07-13 21:14:56,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:14:56,271 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:56,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1046518713, now seen corresponding path program 1 times [2022-07-13 21:14:56,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:56,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890823117] [2022-07-13 21:14:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:56,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:14:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:56,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:14:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:56,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:14:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:56,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:14:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:56,396 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:14:56,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:56,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890823117] [2022-07-13 21:14:56,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890823117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:56,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:56,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:14:56,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726100850] [2022-07-13 21:14:56,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:56,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:14:56,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:56,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:14:56,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:14:56,402 INFO L87 Difference]: Start difference. First operand 406 states and 579 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:14:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:56,841 INFO L93 Difference]: Finished difference Result 753 states and 1087 transitions. [2022-07-13 21:14:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:14:56,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-07-13 21:14:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:56,846 INFO L225 Difference]: With dead ends: 753 [2022-07-13 21:14:56,846 INFO L226 Difference]: Without dead ends: 468 [2022-07-13 21:14:56,850 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:14:56,853 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 585 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:56,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 686 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:14:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-07-13 21:14:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 406. [2022-07-13 21:14:56,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 324 states have (on average 1.4475308641975309) internal successors, (469), 331 states have internal predecessors, (469), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-07-13 21:14:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 576 transitions. [2022-07-13 21:14:56,883 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 576 transitions. Word has length 58 [2022-07-13 21:14:56,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:56,884 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 576 transitions. [2022-07-13 21:14:56,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:14:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 576 transitions. [2022-07-13 21:14:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 21:14:56,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:56,885 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] [2022-07-13 21:14:56,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:14:56,886 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:56,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:56,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1199060741, now seen corresponding path program 1 times [2022-07-13 21:14:56,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:56,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859121538] [2022-07-13 21:14:56,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:56,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:56,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:56,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:14:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:56,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:14:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:56,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:14:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:56,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:14:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:57,006 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:14:57,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:57,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859121538] [2022-07-13 21:14:57,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859121538] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:57,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:57,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:14:57,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859487882] [2022-07-13 21:14:57,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:57,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:14:57,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:57,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:14:57,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:14:57,014 INFO L87 Difference]: Start difference. First operand 406 states and 576 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:14:57,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:57,637 INFO L93 Difference]: Finished difference Result 789 states and 1144 transitions. [2022-07-13 21:14:57,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:14:57,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-07-13 21:14:57,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:57,642 INFO L225 Difference]: With dead ends: 789 [2022-07-13 21:14:57,643 INFO L226 Difference]: Without dead ends: 505 [2022-07-13 21:14:57,644 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:14:57,652 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 285 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:57,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1081 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 21:14:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-13 21:14:57,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 415. [2022-07-13 21:14:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 333 states have (on average 1.4354354354354355) internal successors, (478), 340 states have internal predecessors, (478), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-07-13 21:14:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 585 transitions. [2022-07-13 21:14:57,684 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 585 transitions. Word has length 58 [2022-07-13 21:14:57,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:57,684 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 585 transitions. [2022-07-13 21:14:57,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:14:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 585 transitions. [2022-07-13 21:14:57,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 21:14:57,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:57,686 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] [2022-07-13 21:14:57,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:14:57,686 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:57,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:57,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1044922557, now seen corresponding path program 1 times [2022-07-13 21:14:57,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:57,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000055889] [2022-07-13 21:14:57,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:57,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:57,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:57,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:14:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:57,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:14:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:57,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:14:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:57,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:14:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:57,779 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:14:57,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:57,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000055889] [2022-07-13 21:14:57,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000055889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:57,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:57,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:14:57,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303446746] [2022-07-13 21:14:57,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:57,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:14:57,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:57,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:14:57,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:14:57,781 INFO L87 Difference]: Start difference. First operand 415 states and 585 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:14:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:58,819 INFO L93 Difference]: Finished difference Result 1587 states and 2310 transitions. [2022-07-13 21:14:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 21:14:58,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-07-13 21:14:58,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:58,827 INFO L225 Difference]: With dead ends: 1587 [2022-07-13 21:14:58,828 INFO L226 Difference]: Without dead ends: 1294 [2022-07-13 21:14:58,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-13 21:14:58,830 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 1080 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:58,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1026 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 21:14:58,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2022-07-13 21:14:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1123. [2022-07-13 21:14:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 894 states have (on average 1.3870246085011186) internal successors, (1240), 916 states have internal predecessors, (1240), 140 states have call successors, (140), 81 states have call predecessors, (140), 87 states have return successors, (189), 128 states have call predecessors, (189), 136 states have call successors, (189) [2022-07-13 21:14:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1569 transitions. [2022-07-13 21:14:58,924 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1569 transitions. Word has length 58 [2022-07-13 21:14:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:58,924 INFO L495 AbstractCegarLoop]: Abstraction has 1123 states and 1569 transitions. [2022-07-13 21:14:58,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:14:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1569 transitions. [2022-07-13 21:14:58,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:14:58,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:58,926 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:14:58,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:14:58,926 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:58,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:58,927 INFO L85 PathProgramCache]: Analyzing trace with hash 863362558, now seen corresponding path program 1 times [2022-07-13 21:14:58,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:58,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577441769] [2022-07-13 21:14:58,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:58,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:58,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:14:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:14:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:59,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:14:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:59,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:14:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:59,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:14:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:59,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:14:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:59,022 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:14:59,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:59,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577441769] [2022-07-13 21:14:59,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577441769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:59,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:59,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:14:59,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691739861] [2022-07-13 21:14:59,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:59,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:14:59,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:59,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:14:59,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:14:59,025 INFO L87 Difference]: Start difference. First operand 1123 states and 1569 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:14:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:59,666 INFO L93 Difference]: Finished difference Result 1378 states and 1939 transitions. [2022-07-13 21:14:59,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:14:59,667 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:14:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:59,676 INFO L225 Difference]: With dead ends: 1378 [2022-07-13 21:14:59,676 INFO L226 Difference]: Without dead ends: 1274 [2022-07-13 21:14:59,677 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:14:59,678 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 619 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:59,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1048 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 21:14:59,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2022-07-13 21:14:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1235. [2022-07-13 21:14:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 984 states have (on average 1.3892276422764227) internal successors, (1367), 1008 states have internal predecessors, (1367), 153 states have call successors, (153), 88 states have call predecessors, (153), 96 states have return successors, (207), 142 states have call predecessors, (207), 149 states have call successors, (207) [2022-07-13 21:14:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1727 transitions. [2022-07-13 21:14:59,756 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1727 transitions. Word has length 65 [2022-07-13 21:14:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:59,757 INFO L495 AbstractCegarLoop]: Abstraction has 1235 states and 1727 transitions. [2022-07-13 21:14:59,757 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:14:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1727 transitions. [2022-07-13 21:14:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:14:59,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:59,759 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:14:59,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:14:59,759 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:59,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:59,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1752716098, now seen corresponding path program 1 times [2022-07-13 21:14:59,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:59,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670957053] [2022-07-13 21:14:59,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:59,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:59,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:14:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:59,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:14:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:59,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:14:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:59,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:14:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:59,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:14:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:59,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:14:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:59,867 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:14:59,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:59,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670957053] [2022-07-13 21:14:59,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670957053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:59,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:59,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:14:59,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784945093] [2022-07-13 21:14:59,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:59,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:14:59,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:59,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:14:59,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:14:59,870 INFO L87 Difference]: Start difference. First operand 1235 states and 1727 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:15:00,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:00,743 INFO L93 Difference]: Finished difference Result 1632 states and 2293 transitions. [2022-07-13 21:15:00,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 21:15:00,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-13 21:15:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:00,755 INFO L225 Difference]: With dead ends: 1632 [2022-07-13 21:15:00,755 INFO L226 Difference]: Without dead ends: 1423 [2022-07-13 21:15:00,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-13 21:15:00,758 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 617 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:00,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1225 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 21:15:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2022-07-13 21:15:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1347. [2022-07-13 21:15:00,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1074 states have (on average 1.3901303538175047) internal successors, (1493), 1100 states have internal predecessors, (1493), 166 states have call successors, (166), 95 states have call predecessors, (166), 105 states have return successors, (228), 156 states have call predecessors, (228), 162 states have call successors, (228) [2022-07-13 21:15:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1887 transitions. [2022-07-13 21:15:00,861 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1887 transitions. Word has length 65 [2022-07-13 21:15:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:00,862 INFO L495 AbstractCegarLoop]: Abstraction has 1347 states and 1887 transitions. [2022-07-13 21:15:00,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:15:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1887 transitions. [2022-07-13 21:15:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:15:00,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:00,864 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:00,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:15:00,864 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:00,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:00,865 INFO L85 PathProgramCache]: Analyzing trace with hash 513665088, now seen corresponding path program 1 times [2022-07-13 21:15:00,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:00,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914933129] [2022-07-13 21:15:00,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:00,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:00,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:00,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:00,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:00,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:00,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:15:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:00,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:15:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:00,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:15:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:00,970 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:00,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:00,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914933129] [2022-07-13 21:15:00,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914933129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:00,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:00,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 21:15:00,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679304673] [2022-07-13 21:15:00,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:00,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:15:00,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:00,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:15:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:15:00,974 INFO L87 Difference]: Start difference. First operand 1347 states and 1887 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:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:02,604 INFO L93 Difference]: Finished difference Result 2893 states and 4085 transitions. [2022-07-13 21:15:02,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 21:15:02,605 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:02,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:02,616 INFO L225 Difference]: With dead ends: 2893 [2022-07-13 21:15:02,616 INFO L226 Difference]: Without dead ends: 2560 [2022-07-13 21:15:02,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 21:15:02,619 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 1940 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 2171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:02,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 1809 Invalid, 2171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 21:15:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2022-07-13 21:15:02,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2400. [2022-07-13 21:15:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 1922 states have (on average 1.3720083246618107) internal successors, (2637), 1963 states have internal predecessors, (2637), 276 states have call successors, (276), 178 states have call predecessors, (276), 200 states have return successors, (361), 262 states have call predecessors, (361), 272 states have call successors, (361) [2022-07-13 21:15:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3274 transitions. [2022-07-13 21:15:02,750 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3274 transitions. Word has length 65 [2022-07-13 21:15:02,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:02,751 INFO L495 AbstractCegarLoop]: Abstraction has 2400 states and 3274 transitions. [2022-07-13 21:15:02,751 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:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3274 transitions. [2022-07-13 21:15:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 21:15:02,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:02,752 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:02,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:15:02,753 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:02,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:02,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2024207263, now seen corresponding path program 1 times [2022-07-13 21:15:02,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:02,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514741391] [2022-07-13 21:15:02,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:02,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 21:15:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 21:15:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:02,859 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,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:02,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514741391] [2022-07-13 21:15:02,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514741391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:02,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:02,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:15:02,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243253822] [2022-07-13 21:15:02,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:02,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:15:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:02,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:15:02,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:15:02,862 INFO L87 Difference]: Start difference. First operand 2400 states and 3274 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:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:03,525 INFO L93 Difference]: Finished difference Result 3928 states and 5353 transitions. [2022-07-13 21:15:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:15:03,526 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:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:03,539 INFO L225 Difference]: With dead ends: 3928 [2022-07-13 21:15:03,540 INFO L226 Difference]: Without dead ends: 2548 [2022-07-13 21:15:03,545 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:03,546 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 227 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:03,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1406 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:15:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2022-07-13 21:15:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2440. [2022-07-13 21:15:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 1954 states have (on average 1.3628454452405323) internal successors, (2663), 1995 states have internal predecessors, (2663), 276 states have call successors, (276), 178 states have call predecessors, (276), 208 states have return successors, (369), 270 states have call predecessors, (369), 272 states have call successors, (369) [2022-07-13 21:15:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3308 transitions. [2022-07-13 21:15:03,708 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3308 transitions. Word has length 66 [2022-07-13 21:15:03,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:03,709 INFO L495 AbstractCegarLoop]: Abstraction has 2440 states and 3308 transitions. [2022-07-13 21:15:03,709 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:03,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3308 transitions. [2022-07-13 21:15:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 21:15:03,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:03,710 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:03,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 21:15:03,711 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:03,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash 994847965, now seen corresponding path program 1 times [2022-07-13 21:15:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:03,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821664596] [2022-07-13 21:15:03,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 21:15:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 21:15:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:03,792 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,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:03,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821664596] [2022-07-13 21:15:03,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821664596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:03,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:03,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 21:15:03,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646734807] [2022-07-13 21:15:03,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:03,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:15:03,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:03,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:15:03,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:15:03,795 INFO L87 Difference]: Start difference. First operand 2440 states and 3308 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:05,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:05,521 INFO L93 Difference]: Finished difference Result 6012 states and 8182 transitions. [2022-07-13 21:15:05,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 21:15:05,522 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:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:05,536 INFO L225 Difference]: With dead ends: 6012 [2022-07-13 21:15:05,537 INFO L226 Difference]: Without dead ends: 2831 [2022-07-13 21:15:05,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 21:15:05,546 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 2007 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:05,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2029 Valid, 1849 Invalid, 2107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 21:15:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2022-07-13 21:15:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2651. [2022-07-13 21:15:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2651 states, 2093 states have (on average 1.3325370281892022) internal successors, (2789), 2136 states have internal predecessors, (2789), 316 states have call successors, (316), 206 states have call predecessors, (316), 240 states have return successors, (415), 312 states have call predecessors, (415), 312 states have call successors, (415) [2022-07-13 21:15:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3520 transitions. [2022-07-13 21:15:05,740 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3520 transitions. Word has length 66 [2022-07-13 21:15:05,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:05,741 INFO L495 AbstractCegarLoop]: Abstraction has 2651 states and 3520 transitions. [2022-07-13 21:15:05,741 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:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3520 transitions. [2022-07-13 21:15:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 21:15:05,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:05,746 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:05,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 21:15:05,746 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:05,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:05,747 INFO L85 PathProgramCache]: Analyzing trace with hash 457439213, now seen corresponding path program 1 times [2022-07-13 21:15:05,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:05,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247214259] [2022-07-13 21:15:05,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:05,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 21:15:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 21:15:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 21:15:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:05,877 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:05,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:05,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247214259] [2022-07-13 21:15:05,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247214259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:05,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:05,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:15:05,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584249211] [2022-07-13 21:15:05,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:05,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:15:05,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:05,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:15:05,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:15:05,880 INFO L87 Difference]: Start difference. First operand 2651 states and 3520 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:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:06,525 INFO L93 Difference]: Finished difference Result 4476 states and 5922 transitions. [2022-07-13 21:15:06,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:15:06,525 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:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:06,540 INFO L225 Difference]: With dead ends: 4476 [2022-07-13 21:15:06,541 INFO L226 Difference]: Without dead ends: 2845 [2022-07-13 21:15:06,545 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:06,546 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 219 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:06,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1354 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:15:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2022-07-13 21:15:06,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2711. [2022-07-13 21:15:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2141 states have (on average 1.3222793087342364) internal successors, (2831), 2184 states have internal predecessors, (2831), 316 states have call successors, (316), 206 states have call predecessors, (316), 252 states have return successors, (427), 324 states have call predecessors, (427), 312 states have call successors, (427) [2022-07-13 21:15:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3574 transitions. [2022-07-13 21:15:06,713 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3574 transitions. Word has length 91 [2022-07-13 21:15:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:06,714 INFO L495 AbstractCegarLoop]: Abstraction has 2711 states and 3574 transitions. [2022-07-13 21:15:06,714 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:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3574 transitions. [2022-07-13 21:15:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 21:15:06,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:06,717 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:06,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 21:15:06,718 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:06,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:06,718 INFO L85 PathProgramCache]: Analyzing trace with hash 901339887, now seen corresponding path program 1 times [2022-07-13 21:15:06,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:06,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114219952] [2022-07-13 21:15:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:06,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:06,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:06,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:06,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:06,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:06,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 21:15:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:06,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 21:15:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:06,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 21:15:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:06,808 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:06,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:06,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114219952] [2022-07-13 21:15:06,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114219952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:06,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:06,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:15:06,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968839811] [2022-07-13 21:15:06,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:06,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:15:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:06,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:15:06,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:15:06,811 INFO L87 Difference]: Start difference. First operand 2711 states and 3574 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:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:07,360 INFO L93 Difference]: Finished difference Result 6308 states and 8282 transitions. [2022-07-13 21:15:07,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:15:07,360 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:07,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:07,382 INFO L225 Difference]: With dead ends: 6308 [2022-07-13 21:15:07,382 INFO L226 Difference]: Without dead ends: 4618 [2022-07-13 21:15:07,389 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:07,390 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 784 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:07,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 691 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:15:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4618 states. [2022-07-13 21:15:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4618 to 4398. [2022-07-13 21:15:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4398 states, 3455 states have (on average 1.2931982633863965) internal successors, (4468), 3532 states have internal predecessors, (4468), 505 states have call successors, (505), 338 states have call predecessors, (505), 436 states have return successors, (759), 533 states have call predecessors, (759), 501 states have call successors, (759) [2022-07-13 21:15:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4398 states to 4398 states and 5732 transitions. [2022-07-13 21:15:07,667 INFO L78 Accepts]: Start accepts. Automaton has 4398 states and 5732 transitions. Word has length 91 [2022-07-13 21:15:07,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:07,667 INFO L495 AbstractCegarLoop]: Abstraction has 4398 states and 5732 transitions. [2022-07-13 21:15:07,669 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:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 4398 states and 5732 transitions. [2022-07-13 21:15:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 21:15:07,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:07,672 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:07,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 21:15:07,672 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash -156498191, now seen corresponding path program 1 times [2022-07-13 21:15:07,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:07,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718699083] [2022-07-13 21:15:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:07,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 21:15:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 21:15:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 21:15:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:07,726 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:07,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:07,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718699083] [2022-07-13 21:15:07,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718699083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:07,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:07,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:15:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312265812] [2022-07-13 21:15:07,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:07,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:15:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:07,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:15:07,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:15:07,728 INFO L87 Difference]: Start difference. First operand 4398 states and 5732 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:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:08,126 INFO L93 Difference]: Finished difference Result 6206 states and 8000 transitions. [2022-07-13 21:15:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 21:15:08,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:08,140 INFO L225 Difference]: With dead ends: 6206 [2022-07-13 21:15:08,141 INFO L226 Difference]: Without dead ends: 2829 [2022-07-13 21:15:08,150 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:08,151 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 434 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:08,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 636 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:15:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2022-07-13 21:15:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2711. [2022-07-13 21:15:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2141 states have (on average 1.3021952358710882) internal successors, (2788), 2184 states have internal predecessors, (2788), 316 states have call successors, (316), 206 states have call predecessors, (316), 252 states have return successors, (427), 324 states have call predecessors, (427), 312 states have call successors, (427) [2022-07-13 21:15:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3531 transitions. [2022-07-13 21:15:08,299 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3531 transitions. Word has length 91 [2022-07-13 21:15:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:08,299 INFO L495 AbstractCegarLoop]: Abstraction has 2711 states and 3531 transitions. [2022-07-13 21:15:08,299 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:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3531 transitions. [2022-07-13 21:15:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 21:15:08,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:08,304 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:08,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 21:15:08,305 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:08,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:08,305 INFO L85 PathProgramCache]: Analyzing trace with hash 435090271, now seen corresponding path program 1 times [2022-07-13 21:15:08,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:08,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931730441] [2022-07-13 21:15:08,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:08,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:15:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:15:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:15:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 21:15:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 21:15:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 21:15:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:08,389 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:08,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:08,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931730441] [2022-07-13 21:15:08,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931730441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:08,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:08,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:15:08,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943691544] [2022-07-13 21:15:08,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:08,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:15:08,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:08,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:15:08,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:15:08,392 INFO L87 Difference]: Start difference. First operand 2711 states and 3531 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:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:09,511 INFO L93 Difference]: Finished difference Result 5520 states and 7110 transitions. [2022-07-13 21:15:09,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 21:15:09,511 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:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:09,537 INFO L225 Difference]: With dead ends: 5520 [2022-07-13 21:15:09,537 INFO L226 Difference]: Without dead ends: 3525 [2022-07-13 21:15:09,544 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:09,546 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 1228 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:09,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 1231 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 21:15:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2022-07-13 21:15:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 3348. [2022-07-13 21:15:09,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3348 states, 2619 states have (on average 1.272241313478427) internal successors, (3332), 2671 states have internal predecessors, (3332), 395 states have call successors, (395), 255 states have call predecessors, (395), 332 states have return successors, (563), 425 states have call predecessors, (563), 391 states have call successors, (563) [2022-07-13 21:15:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3348 states to 3348 states and 4290 transitions. [2022-07-13 21:15:09,769 INFO L78 Accepts]: Start accepts. Automaton has 3348 states and 4290 transitions. Word has length 92 [2022-07-13 21:15:09,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:09,770 INFO L495 AbstractCegarLoop]: Abstraction has 3348 states and 4290 transitions. [2022-07-13 21:15:09,770 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:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3348 states and 4290 transitions. [2022-07-13 21:15:09,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-13 21:15:09,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:09,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 21:15:09,773 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:09,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:09,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1866213314, now seen corresponding path program 1 times [2022-07-13 21:15:09,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:09,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813700978] [2022-07-13 21:15:09,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:09,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:15:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:15:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:15:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 21:15:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 21:15:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 21:15:09,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:09,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813700978] [2022-07-13 21:15:09,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813700978] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:09,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299274852] [2022-07-13 21:15:09,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:09,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:09,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:09,867 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:09,870 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:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:09,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:15:09,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 21:15:10,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:10,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299274852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:10,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:10,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:15:10,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361980187] [2022-07-13 21:15:10,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:10,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:10,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:10,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:10,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:10,030 INFO L87 Difference]: Start difference. First operand 3348 states and 4290 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:15:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:10,287 INFO L93 Difference]: Finished difference Result 5241 states and 6949 transitions. [2022-07-13 21:15:10,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:10,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2022-07-13 21:15:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:10,311 INFO L225 Difference]: With dead ends: 5241 [2022-07-13 21:15:10,312 INFO L226 Difference]: Without dead ends: 3594 [2022-07-13 21:15:10,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:10,321 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 113 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 678 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:10,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 678 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:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2022-07-13 21:15:10,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3594. [2022-07-13 21:15:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3594 states, 2817 states have (on average 1.2765353212637558) internal successors, (3596), 2871 states have internal predecessors, (3596), 423 states have call successors, (423), 273 states have call predecessors, (423), 352 states have return successors, (605), 453 states have call predecessors, (605), 419 states have call successors, (605) [2022-07-13 21:15:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 4624 transitions. [2022-07-13 21:15:10,514 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 4624 transitions. Word has length 93 [2022-07-13 21:15:10,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:10,515 INFO L495 AbstractCegarLoop]: Abstraction has 3594 states and 4624 transitions. [2022-07-13 21:15:10,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:15:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 4624 transitions. [2022-07-13 21:15:10,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-13 21:15:10,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:10,519 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:10,550 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:10,735 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,SelfDestructingSolverStorable14 [2022-07-13 21:15:10,735 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:10,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash -287830492, now seen corresponding path program 1 times [2022-07-13 21:15:10,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:10,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137222604] [2022-07-13 21:15:10,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:10,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:15:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:15:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:15:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 21:15:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 21:15:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 21:15:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 21:15:10,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:10,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137222604] [2022-07-13 21:15:10,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137222604] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:10,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739139606] [2022-07-13 21:15:10,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:10,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:10,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:10,835 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:10,858 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:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:10,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:15:10,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 21:15:11,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:11,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739139606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:11,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:11,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-13 21:15:11,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600166745] [2022-07-13 21:15:11,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:11,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:11,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:11,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:11,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:11,028 INFO L87 Difference]: Start difference. First operand 3594 states and 4624 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 21:15:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:11,290 INFO L93 Difference]: Finished difference Result 5345 states and 7099 transitions. [2022-07-13 21:15:11,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:11,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2022-07-13 21:15:11,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:11,306 INFO L225 Difference]: With dead ends: 5345 [2022-07-13 21:15:11,306 INFO L226 Difference]: Without dead ends: 4330 [2022-07-13 21:15:11,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:11,313 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 223 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 456 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:11,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 456 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:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2022-07-13 21:15:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 4302. [2022-07-13 21:15:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4302 states, 3390 states have (on average 1.2926253687315634) internal successors, (4382), 3453 states have internal predecessors, (4382), 501 states have call successors, (501), 324 states have call predecessors, (501), 409 states have return successors, (709), 528 states have call predecessors, (709), 497 states have call successors, (709) [2022-07-13 21:15:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 5592 transitions. [2022-07-13 21:15:11,589 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 5592 transitions. Word has length 119 [2022-07-13 21:15:11,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:11,590 INFO L495 AbstractCegarLoop]: Abstraction has 4302 states and 5592 transitions. [2022-07-13 21:15:11,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 21:15:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 5592 transitions. [2022-07-13 21:15:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 21:15:11,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:11,595 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:11,621 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:11,795 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,SelfDestructingSolverStorable15 [2022-07-13 21:15:11,795 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:11,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:11,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1068470771, now seen corresponding path program 1 times [2022-07-13 21:15:11,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:11,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978160786] [2022-07-13 21:15:11,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:11,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:15:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:15:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:15:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 21:15:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 21:15:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 21:15:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 21:15:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-13 21:15:11,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:11,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978160786] [2022-07-13 21:15:11,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978160786] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:11,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432521925] [2022-07-13 21:15:11,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:11,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:11,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:11,876 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:11,877 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:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:11,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:15:11,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 21:15:11,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:11,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432521925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:11,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:11,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:15:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397428538] [2022-07-13 21:15:11,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:11,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:11,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:11,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:11,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:11,999 INFO L87 Difference]: Start difference. First operand 4302 states and 5592 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 21:15:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:12,221 INFO L93 Difference]: Finished difference Result 6564 states and 8764 transitions. [2022-07-13 21:15:12,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:12,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2022-07-13 21:15:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:12,238 INFO L225 Difference]: With dead ends: 6564 [2022-07-13 21:15:12,239 INFO L226 Difference]: Without dead ends: 4608 [2022-07-13 21:15:12,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:12,247 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 274 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 321 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:12,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 321 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:12,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2022-07-13 21:15:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 4542. [2022-07-13 21:15:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4542 states, 3609 states have (on average 1.2618453865336658) internal successors, (4554), 3669 states have internal predecessors, (4554), 501 states have call successors, (501), 342 states have call predecessors, (501), 430 states have return successors, (703), 534 states have call predecessors, (703), 497 states have call successors, (703) [2022-07-13 21:15:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4542 states to 4542 states and 5758 transitions. [2022-07-13 21:15:12,534 INFO L78 Accepts]: Start accepts. Automaton has 4542 states and 5758 transitions. Word has length 135 [2022-07-13 21:15:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:12,534 INFO L495 AbstractCegarLoop]: Abstraction has 4542 states and 5758 transitions. [2022-07-13 21:15:12,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 21:15:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 4542 states and 5758 transitions. [2022-07-13 21:15:12,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 21:15:12,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:12,539 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:12,568 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:12,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:12,753 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:12,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:12,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1809607182, now seen corresponding path program 1 times [2022-07-13 21:15:12,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:12,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29451565] [2022-07-13 21:15:12,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:12,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:12,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:12,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:12,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:15:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:12,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:15:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:12,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:15:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:12,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 21:15:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:12,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 21:15:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:12,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:12,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 21:15:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:12,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:12,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 21:15:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-13 21:15:12,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:12,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29451565] [2022-07-13 21:15:12,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29451565] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:12,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563261502] [2022-07-13 21:15:12,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:12,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:12,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:12,840 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:12,842 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:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:12,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 21:15:12,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 21:15:12,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:12,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563261502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:12,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:12,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:15:12,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197129164] [2022-07-13 21:15:12,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:12,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:12,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:12,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:12,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:12,955 INFO L87 Difference]: Start difference. First operand 4542 states and 5758 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 21:15:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:13,228 INFO L93 Difference]: Finished difference Result 6787 states and 8719 transitions. [2022-07-13 21:15:13,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:13,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 135 [2022-07-13 21:15:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:13,244 INFO L225 Difference]: With dead ends: 6787 [2022-07-13 21:15:13,244 INFO L226 Difference]: Without dead ends: 4593 [2022-07-13 21:15:13,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:13,252 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 262 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 444 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:13,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 444 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:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2022-07-13 21:15:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4524. [2022-07-13 21:15:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 3591 states have (on average 1.2481203007518797) internal successors, (4482), 3651 states have internal predecessors, (4482), 501 states have call successors, (501), 342 states have call predecessors, (501), 430 states have return successors, (703), 534 states have call predecessors, (703), 497 states have call successors, (703) [2022-07-13 21:15:13,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 5686 transitions. [2022-07-13 21:15:13,524 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 5686 transitions. Word has length 135 [2022-07-13 21:15:13,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:13,524 INFO L495 AbstractCegarLoop]: Abstraction has 4524 states and 5686 transitions. [2022-07-13 21:15:13,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 21:15:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 5686 transitions. [2022-07-13 21:15:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 21:15:13,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:13,529 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:13,558 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:13,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 21:15:13,743 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:13,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:13,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1867127916, now seen corresponding path program 1 times [2022-07-13 21:15:13,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:13,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552017696] [2022-07-13 21:15:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:13,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:15:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:15:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:15:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:15:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:15:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:15:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 21:15:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-13 21:15:13,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:13,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552017696] [2022-07-13 21:15:13,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552017696] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:13,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376252654] [2022-07-13 21:15:13,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:13,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:13,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:13,864 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:13,865 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:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:13,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 21:15:13,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 21:15:14,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:14,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376252654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:14,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:14,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:15:14,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429720963] [2022-07-13 21:15:14,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:14,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:15:14,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:14,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:15:14,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:14,010 INFO L87 Difference]: Start difference. First operand 4524 states and 5686 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 21:15:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:14,278 INFO L93 Difference]: Finished difference Result 5468 states and 6974 transitions. [2022-07-13 21:15:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:15:14,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2022-07-13 21:15:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:14,294 INFO L225 Difference]: With dead ends: 5468 [2022-07-13 21:15:14,295 INFO L226 Difference]: Without dead ends: 4360 [2022-07-13 21:15:14,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:15:14,301 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 87 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 677 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:14,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 677 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:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2022-07-13 21:15:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 4320. [2022-07-13 21:15:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4320 states, 3429 states have (on average 1.2379702537182853) internal successors, (4245), 3487 states have internal predecessors, (4245), 479 states have call successors, (479), 327 states have call predecessors, (479), 410 states have return successors, (663), 509 states have call predecessors, (663), 475 states have call successors, (663) [2022-07-13 21:15:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4320 states to 4320 states and 5387 transitions. [2022-07-13 21:15:14,553 INFO L78 Accepts]: Start accepts. Automaton has 4320 states and 5387 transitions. Word has length 136 [2022-07-13 21:15:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:14,553 INFO L495 AbstractCegarLoop]: Abstraction has 4320 states and 5387 transitions. [2022-07-13 21:15:14,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 21:15:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4320 states and 5387 transitions. [2022-07-13 21:15:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 21:15:14,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:14,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:14,586 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:14,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:14,780 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:14,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:14,780 INFO L85 PathProgramCache]: Analyzing trace with hash -895196586, now seen corresponding path program 1 times [2022-07-13 21:15:14,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:14,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782663715] [2022-07-13 21:15:14,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:14,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:15:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:15:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:15:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:15:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:15:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:15:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:15:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-13 21:15:14,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:14,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782663715] [2022-07-13 21:15:14,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782663715] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:14,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368971608] [2022-07-13 21:15:14,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:14,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:14,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:14,872 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:14,874 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:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:14,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 21:15:14,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-13 21:15:15,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:15,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368971608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:15,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:15,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-13 21:15:15,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201270424] [2022-07-13 21:15:15,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:15,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:15:15,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:15,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:15:15,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:15:15,071 INFO L87 Difference]: Start difference. First operand 4320 states and 5387 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:15:15,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:15,482 INFO L93 Difference]: Finished difference Result 5678 states and 7141 transitions. [2022-07-13 21:15:15,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 21:15:15,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-07-13 21:15:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:15,499 INFO L225 Difference]: With dead ends: 5678 [2022-07-13 21:15:15,499 INFO L226 Difference]: Without dead ends: 4313 [2022-07-13 21:15:15,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:15:15,506 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 330 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:15,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 533 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:15:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2022-07-13 21:15:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 3744. [2022-07-13 21:15:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 2961 states have (on average 1.2228976697061804) internal successors, (3621), 3009 states have internal predecessors, (3621), 421 states have call successors, (421), 284 states have call predecessors, (421), 360 states have return successors, (571), 453 states have call predecessors, (571), 417 states have call successors, (571) [2022-07-13 21:15:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 4613 transitions. [2022-07-13 21:15:15,751 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 4613 transitions. Word has length 137 [2022-07-13 21:15:15,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:15,751 INFO L495 AbstractCegarLoop]: Abstraction has 3744 states and 4613 transitions. [2022-07-13 21:15:15,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:15:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 4613 transitions. [2022-07-13 21:15:15,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 21:15:15,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:15,755 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:15,786 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:15,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:15,968 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:15,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1533062036, now seen corresponding path program 1 times [2022-07-13 21:15:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:15,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727404216] [2022-07-13 21:15:15,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:15,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:15,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:15:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:15:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:15:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:15:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:15:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:15:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:15:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-13 21:15:16,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:16,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727404216] [2022-07-13 21:15:16,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727404216] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:16,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477699989] [2022-07-13 21:15:16,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:16,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:16,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:16,070 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:16,072 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:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:16,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 21:15:16,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-13 21:15:16,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:16,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477699989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:16,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:16,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-13 21:15:16,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663053220] [2022-07-13 21:15:16,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:16,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:15:16,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:16,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:15:16,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:15:16,253 INFO L87 Difference]: Start difference. First operand 3744 states and 4613 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:15:16,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:16,658 INFO L93 Difference]: Finished difference Result 4876 states and 6006 transitions. [2022-07-13 21:15:16,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 21:15:16,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-07-13 21:15:16,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:16,670 INFO L225 Difference]: With dead ends: 4876 [2022-07-13 21:15:16,670 INFO L226 Difference]: Without dead ends: 3480 [2022-07-13 21:15:16,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-13 21:15:16,676 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 351 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:16,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 541 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:15:16,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2022-07-13 21:15:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3458. [2022-07-13 21:15:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 2733 states have (on average 1.2034394438346139) internal successors, (3289), 2777 states have internal predecessors, (3289), 383 states have call successors, (383), 262 states have call predecessors, (383), 340 states have return successors, (522), 421 states have call predecessors, (522), 379 states have call successors, (522) [2022-07-13 21:15:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4194 transitions. [2022-07-13 21:15:16,905 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4194 transitions. Word has length 137 [2022-07-13 21:15:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:16,905 INFO L495 AbstractCegarLoop]: Abstraction has 3458 states and 4194 transitions. [2022-07-13 21:15:16,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:15:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4194 transitions. [2022-07-13 21:15:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 21:15:16,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:16,909 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:16,935 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:17,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:17,125 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:17,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:17,125 INFO L85 PathProgramCache]: Analyzing trace with hash 225919638, now seen corresponding path program 1 times [2022-07-13 21:15:17,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:17,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456772928] [2022-07-13 21:15:17,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:17,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:15:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:15:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:15:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:15:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:15:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:15:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [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 122 [2022-07-13 21:15:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-13 21:15:17,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:17,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456772928] [2022-07-13 21:15:17,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456772928] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:15:17,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909541075] [2022-07-13 21:15:17,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:17,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:15:17,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:15:17,211 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:17,213 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:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:17,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 21:15:17,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:15:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 21:15:17,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:15:17,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909541075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:17,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:15:17,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-13 21:15:17,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650679990] [2022-07-13 21:15:17,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:17,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:15:17,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:17,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:15:17,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:15:17,367 INFO L87 Difference]: Start difference. First operand 3458 states and 4194 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:15:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:17,621 INFO L93 Difference]: Finished difference Result 4597 states and 5591 transitions. [2022-07-13 21:15:17,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 21:15:17,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-07-13 21:15:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:17,633 INFO L225 Difference]: With dead ends: 4597 [2022-07-13 21:15:17,633 INFO L226 Difference]: Without dead ends: 3486 [2022-07-13 21:15:17,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:15:17,640 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 10 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1151 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:17,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1151 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:17,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2022-07-13 21:15:17,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3470. [2022-07-13 21:15:17,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 2745 states have (on average 1.1948998178506376) internal successors, (3280), 2789 states have internal predecessors, (3280), 383 states have call successors, (383), 262 states have call predecessors, (383), 340 states have return successors, (522), 421 states have call predecessors, (522), 379 states have call successors, (522) [2022-07-13 21:15:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 4185 transitions. [2022-07-13 21:15:17,870 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 4185 transitions. Word has length 137 [2022-07-13 21:15:17,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:17,870 INFO L495 AbstractCegarLoop]: Abstraction has 3470 states and 4185 transitions. [2022-07-13 21:15:17,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:15:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 4185 transitions. [2022-07-13 21:15:17,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 21:15:17,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:17,874 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:17,902 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:18,087 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,SelfDestructingSolverStorable21 [2022-07-13 21:15:18,088 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:18,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:18,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1775392230, now seen corresponding path program 1 times [2022-07-13 21:15:18,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:18,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841251198] [2022-07-13 21:15:18,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:18,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:15:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:15:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:15:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:15:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:15:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:15:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:15:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-13 21:15:18,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:18,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841251198] [2022-07-13 21:15:18,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841251198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:18,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:18,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:15:18,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248928175] [2022-07-13 21:15:18,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:18,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:15:18,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:18,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:15:18,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:15:18,185 INFO L87 Difference]: Start difference. First operand 3470 states and 4185 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 21:15:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:19,051 INFO L93 Difference]: Finished difference Result 4448 states and 5284 transitions. [2022-07-13 21:15:19,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:15:19,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2022-07-13 21:15:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:19,066 INFO L225 Difference]: With dead ends: 4448 [2022-07-13 21:15:19,067 INFO L226 Difference]: Without dead ends: 4445 [2022-07-13 21:15:19,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-13 21:15:19,070 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 727 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:19,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 843 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:15:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states. [2022-07-13 21:15:19,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 4174. [2022-07-13 21:15:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4174 states, 3325 states have (on average 1.1819548872180452) internal successors, (3930), 3375 states have internal predecessors, (3930), 451 states have call successors, (451), 310 states have call predecessors, (451), 396 states have return successors, (601), 491 states have call predecessors, (601), 447 states have call successors, (601) [2022-07-13 21:15:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 4982 transitions. [2022-07-13 21:15:19,468 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 4982 transitions. Word has length 137 [2022-07-13 21:15:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:19,468 INFO L495 AbstractCegarLoop]: Abstraction has 4174 states and 4982 transitions. [2022-07-13 21:15:19,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 21:15:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 4982 transitions. [2022-07-13 21:15:19,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-13 21:15:19,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:19,472 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:19,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 21:15:19,473 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:19,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:19,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1319300478, now seen corresponding path program 1 times [2022-07-13 21:15:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:19,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651649632] [2022-07-13 21:15:19,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:19,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:15:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:15:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:15:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:15:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:15:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:15:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:15:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:15:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:15:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:15:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:15:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-13 21:15:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:15:19,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651649632] [2022-07-13 21:15:19,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651649632] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:15:19,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:15:19,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 21:15:19,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419625758] [2022-07-13 21:15:19,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:15:19,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:15:19,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:15:19,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:15:19,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 21:15:19,538 INFO L87 Difference]: Start difference. First operand 4174 states and 4982 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:15:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:15:20,094 INFO L93 Difference]: Finished difference Result 5929 states and 7136 transitions. [2022-07-13 21:15:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 21:15:20,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2022-07-13 21:15:20,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:15:20,111 INFO L225 Difference]: With dead ends: 5929 [2022-07-13 21:15:20,111 INFO L226 Difference]: Without dead ends: 4691 [2022-07-13 21:15:20,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:15:20,118 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 252 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:15:20,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 805 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:15:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2022-07-13 21:15:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 4176. [2022-07-13 21:15:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 3327 states have (on average 1.1818455064622784) internal successors, (3932), 3377 states have internal predecessors, (3932), 451 states have call successors, (451), 310 states have call predecessors, (451), 396 states have return successors, (601), 491 states have call predecessors, (601), 447 states have call successors, (601) [2022-07-13 21:15:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 4984 transitions. [2022-07-13 21:15:20,481 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 4984 transitions. Word has length 141 [2022-07-13 21:15:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:15:20,482 INFO L495 AbstractCegarLoop]: Abstraction has 4176 states and 4984 transitions. [2022-07-13 21:15:20,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:15:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 4984 transitions. [2022-07-13 21:15:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-13 21:15:20,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:15:20,486 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:15:20,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 21:15:20,487 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:15:20,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:15:20,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1014498838, now seen corresponding path program 1 times [2022-07-13 21:15:20,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:15:20,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722992012] [2022-07-13 21:15:20,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:15:20,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:15:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:15:20,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:15:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:15:20,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:15:20,570 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:15:20,571 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-13 21:15:20,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-13 21:15:20,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 21:15:20,576 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] [2022-07-13 21:15:20,580 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:15:20,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:15:20 BoogieIcfgContainer [2022-07-13 21:15:20,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:15:20,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:15:20,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:15:20,735 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:15:20,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:14:53" (3/4) ... [2022-07-13 21:15:20,737 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:15:20,854 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:15:20,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:15:20,855 INFO L158 Benchmark]: Toolchain (without parser) took 28424.59ms. Allocated memory was 83.9MB in the beginning and 778.0MB in the end (delta: 694.2MB). Free memory was 51.8MB in the beginning and 575.1MB in the end (delta: -523.2MB). Peak memory consumption was 170.2MB. Max. memory is 16.1GB. [2022-07-13 21:15:20,855 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory was 54.0MB in the beginning and 54.0MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:15:20,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.44ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 51.8MB in the beginning and 71.3MB in the end (delta: -19.5MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2022-07-13 21:15:20,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.99ms. Allocated memory is still 100.7MB. Free memory was 71.3MB in the beginning and 68.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:15:20,856 INFO L158 Benchmark]: Boogie Preprocessor took 62.24ms. Allocated memory is still 100.7MB. Free memory was 68.4MB in the beginning and 66.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:15:20,856 INFO L158 Benchmark]: RCFGBuilder took 714.47ms. Allocated memory is still 100.7MB. Free memory was 66.2MB in the beginning and 65.4MB in the end (delta: 748.8kB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2022-07-13 21:15:20,858 INFO L158 Benchmark]: TraceAbstraction took 27003.03ms. Allocated memory was 100.7MB in the beginning and 778.0MB in the end (delta: 677.4MB). Free memory was 64.7MB in the beginning and 591.8MB in the end (delta: -527.1MB). Peak memory consumption was 148.6MB. Max. memory is 16.1GB. [2022-07-13 21:15:20,858 INFO L158 Benchmark]: Witness Printer took 119.51ms. Allocated memory is still 778.0MB. Free memory was 591.8MB in the beginning and 575.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 21:15:20,866 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.24ms. Allocated memory is still 83.9MB. Free memory was 54.0MB in the beginning and 54.0MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.44ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 51.8MB in the beginning and 71.3MB in the end (delta: -19.5MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.99ms. Allocated memory is still 100.7MB. Free memory was 71.3MB in the beginning and 68.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.24ms. Allocated memory is still 100.7MB. Free memory was 68.4MB in the beginning and 66.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 714.47ms. Allocated memory is still 100.7MB. Free memory was 66.2MB in the beginning and 65.4MB in the end (delta: 748.8kB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 27003.03ms. Allocated memory was 100.7MB in the beginning and 778.0MB in the end (delta: 677.4MB). Free memory was 64.7MB in the beginning and 591.8MB in the end (delta: -527.1MB). Peak memory consumption was 148.6MB. Max. memory is 16.1GB. * Witness Printer took 119.51ms. Allocated memory is still 778.0MB. Free memory was 591.8MB in the beginning and 575.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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 m_st ; [L606] int t1_st ; [L607] int m_i ; [L608] int t1_i ; [L609] int M_E = 2; [L610] int T1_E = 2; [L611] int E_M = 2; [L612] int E_1 = 2; [L616] int token ; [L618] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L1077] COND FALSE !(__VERIFIER_nondet_int()) [L1080] CALL main2() [L1064] int __retres1 ; [L1068] CALL init_model2() [L979] m_i = 1 [L980] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L1068] RET init_model2() [L1069] CALL start_simulation2() [L1005] int kernel_st ; [L1006] int tmp ; [L1007] int tmp___0 ; [L1011] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L1012] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L1013] CALL init_threads2() [L761] COND TRUE m_i == 1 [L762] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L766] COND TRUE t1_i == 1 [L767] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L1013] RET init_threads2() [L1014] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L850] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L855] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L860] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L865] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L1014] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L1015] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L715] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L725] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L727] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp=0, token=0] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L734] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L744] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L746] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp=0, tmp___0=0, token=0] [L1015] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L1016] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L878] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L883] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L888] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L893] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L1016] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L1019] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L1022] kernel_st = 1 [L1023] CALL eval2() [L797] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L804] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L792] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L804] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, 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, token=0] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp=1, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp=1, tmp_ndt_1=0, token=0] [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE \read(tmp_ndt_2) [L830] t1_st = 1 [L831] CALL transmit1() [L679] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L690] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L692] t1_pc = 1 [L693] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L831] RET transmit1() [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L804] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L792] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L804] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, 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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp_var=0, token=0] [L634] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp_var=0, token=0] [L637] token = __VERIFIER_nondet_int() [L638] local = token [L639] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, tmp_var=0, token=0] [L640] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, token=0] [L932] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, token=0] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, token=0] [L715] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, token=0] [L725] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, token=0] [L727] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, token=0] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, tmp=0, token=0] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, token=0] [L734] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, token=0] [L735] COND TRUE E_1 == 1 [L736] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, token=0] [L746] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, token=0] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND TRUE \read(tmp___0) [L919] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, tmp=0, tmp___0=1, token=0] [L932] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, token=0] [L640] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, 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, tmp_var=0, token=0] [L641] E_1 = 2 [L642] m_pc = 1 [L643] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp_var=0, token=0] [L817] RET master() [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE \read(tmp_ndt_2) [L830] t1_st = 1 [L831] CALL transmit1() [L679] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L682] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=0] [L698] token += 1 [L699] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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, token=1] [L700] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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, token=1] [L932] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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, token=1] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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, token=1] [L715] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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, token=1] [L716] COND TRUE E_M == 1 [L717] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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, token=1] [L727] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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, token=1] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND TRUE \read(tmp) [L911] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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=1, tmp=1, token=1] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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=1, token=1] [L734] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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=1, token=1] [L735] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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=1, token=1] [L744] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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=1, token=1] [L746] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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=1, token=1] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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=1, tmp=1, tmp___0=0, token=1] [L932] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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=1, token=1] [L700] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, 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=1, token=1] [L701] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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=1, token=1] [L690] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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=1, token=1] [L692] t1_pc = 1 [L693] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=1] [L831] RET transmit1() [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L804] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=1] [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=1] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=1] [L792] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=1] [L804] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, 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, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp_var=5, token=1] [L626] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp_var=5, token=1] [L648] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp_var=5, token=1] [L653] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp_var=5, token=1] [L654] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp_var=5, token=1] [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_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, tmp_var=5, token=1] [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_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, tmp_var=5, token=1] [L661] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, tmp_var=5, token=1] [L662] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, 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, token=1] [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_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, token=1] - 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, 232 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 26.8s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14090 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13773 mSDsluCounter, 22565 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14502 mSDsCounter, 3486 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12105 IncrementalHoareTripleChecker+Invalid, 15591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3486 mSolverCounterUnsat, 8063 mSDtfsCounter, 12105 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1806 GetRequests, 1491 SyntacticMatches, 2 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4542occurred in iteration=17, InterpolantAutomatonStates: 270, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 3240 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 3460 NumberOfCodeBlocks, 3460 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3286 ConstructedInterpolants, 0 QuantifiedInterpolants, 5747 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3510 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 1282/1357 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:15:20,912 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