./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 791161d1 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-?-791161d [2022-07-22 20:50:58,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 20:50:58,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 20:50:58,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 20:50:58,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 20:50:58,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 20:50:58,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 20:50:58,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 20:50:58,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 20:50:58,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 20:50:58,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 20:50:58,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 20:50:58,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 20:50:58,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 20:50:58,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 20:50:58,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 20:50:58,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 20:50:58,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 20:50:58,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 20:50:58,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 20:50:58,285 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 20:50:58,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 20:50:58,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 20:50:58,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 20:50:58,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 20:50:58,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 20:50:58,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 20:50:58,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 20:50:58,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 20:50:58,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 20:50:58,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 20:50:58,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 20:50:58,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 20:50:58,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 20:50:58,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 20:50:58,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 20:50:58,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 20:50:58,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 20:50:58,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 20:50:58,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 20:50:58,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 20:50:58,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 20:50:58,309 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 20:50:58,330 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 20:50:58,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 20:50:58,331 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 20:50:58,331 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 20:50:58,332 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 20:50:58,332 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 20:50:58,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 20:50:58,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 20:50:58,334 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 20:50:58,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 20:50:58,335 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 20:50:58,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 20:50:58,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 20:50:58,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 20:50:58,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 20:50:58,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 20:50:58,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 20:50:58,337 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 20:50:58,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 20:50:58,338 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 20:50:58,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 20:50:58,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 20:50:58,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 20:50:58,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 20:50:58,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 20:50:58,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 20:50:58,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 20:50:58,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 20:50:58,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 20:50:58,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 20:50:58,340 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 20:50:58,340 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 20:50:58,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 20:50:58,341 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-22 20:50:58,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 20:50:58,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 20:50:58,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 20:50:58,612 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 20:50:58,612 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 20:50:58,613 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-22 20:50:58,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041087174/9124532ec90c488c9ba84789ed003690/FLAG02de10058 [2022-07-22 20:50:59,146 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 20:50:59,147 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-22 20:50:59,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041087174/9124532ec90c488c9ba84789ed003690/FLAG02de10058 [2022-07-22 20:50:59,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041087174/9124532ec90c488c9ba84789ed003690 [2022-07-22 20:50:59,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 20:50:59,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 20:50:59,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 20:50:59,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 20:50:59,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 20:50:59,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 08:50:59" (1/1) ... [2022-07-22 20:50:59,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0f4846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:50:59, skipping insertion in model container [2022-07-22 20:50:59,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 08:50:59" (1/1) ... [2022-07-22 20:50:59,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 20:50:59,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 20:50:59,676 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-22 20:50:59,766 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-22 20:50:59,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 20:50:59,822 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 20:50:59,840 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-22 20:50:59,868 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-22 20:50:59,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 20:50:59,905 INFO L208 MainTranslator]: Completed translation [2022-07-22 20:50:59,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:50:59 WrapperNode [2022-07-22 20:50:59,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 20:50:59,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 20:50:59,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 20:50:59,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 20:50:59,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:50:59" (1/1) ... [2022-07-22 20:50:59,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:50:59" (1/1) ... [2022-07-22 20:50:59,951 INFO L137 Inliner]: procedures = 57, calls = 65, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 445 [2022-07-22 20:50:59,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 20:50:59,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 20:50:59,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 20:50:59,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 20:50:59,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:50:59" (1/1) ... [2022-07-22 20:50:59,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:50:59" (1/1) ... [2022-07-22 20:50:59,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:50:59" (1/1) ... [2022-07-22 20:50:59,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:50:59" (1/1) ... [2022-07-22 20:50:59,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:50:59" (1/1) ... [2022-07-22 20:50:59,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:50:59" (1/1) ... [2022-07-22 20:51:00,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:50:59" (1/1) ... [2022-07-22 20:51:00,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 20:51:00,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 20:51:00,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 20:51:00,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 20:51:00,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:50:59" (1/1) ... [2022-07-22 20:51:00,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 20:51:00,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:00,040 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-22 20:51:00,042 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-22 20:51:00,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 20:51:00,071 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-22 20:51:00,071 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-22 20:51:00,071 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-22 20:51:00,071 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-22 20:51:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-22 20:51:00,072 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-22 20:51:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-22 20:51:00,072 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-22 20:51:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-22 20:51:00,072 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-22 20:51:00,073 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-22 20:51:00,073 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-22 20:51:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-22 20:51:00,076 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-22 20:51:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-22 20:51:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-22 20:51:00,077 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-22 20:51:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-22 20:51:00,077 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-22 20:51:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-22 20:51:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-22 20:51:00,078 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-22 20:51:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 20:51:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-22 20:51:00,079 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-22 20:51:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-22 20:51:00,079 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-22 20:51:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 20:51:00,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 20:51:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-22 20:51:00,080 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-22 20:51:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-07-22 20:51:00,080 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-07-22 20:51:00,152 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 20:51:00,153 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 20:51:00,583 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-07-22 20:51:00,584 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-22 20:51:00,619 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 20:51:00,628 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 20:51:00,628 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-22 20:51:00,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:51:00 BoogieIcfgContainer [2022-07-22 20:51:00,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 20:51:00,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 20:51:00,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 20:51:00,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 20:51:00,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 08:50:59" (1/3) ... [2022-07-22 20:51:00,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd7bffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 08:51:00, skipping insertion in model container [2022-07-22 20:51:00,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:50:59" (2/3) ... [2022-07-22 20:51:00,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd7bffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 08:51:00, skipping insertion in model container [2022-07-22 20:51:00,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:51:00" (3/3) ... [2022-07-22 20:51:00,641 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-2.c [2022-07-22 20:51:00,654 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 20:51:00,655 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 20:51:00,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 20:51:00,709 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@5061c48a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70c634f4 [2022-07-22 20:51:00,709 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-22 20:51:00,713 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-22 20:51:00,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-22 20:51:00,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:00,726 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-22 20:51:00,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash 560703049, now seen corresponding path program 1 times [2022-07-22 20:51:00,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:00,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263687076] [2022-07-22 20:51:00,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:00,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:00,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:00,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:01,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:01,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:01,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:01,071 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-22 20:51:01,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:01,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263687076] [2022-07-22 20:51:01,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263687076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:01,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:01,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:51:01,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370904689] [2022-07-22 20:51:01,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:01,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:51:01,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:01,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:51:01,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:51:01,114 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-22 20:51:01,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:01,953 INFO L93 Difference]: Finished difference Result 584 states and 884 transitions. [2022-07-22 20:51:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 20:51:01,955 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-22 20:51:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:01,967 INFO L225 Difference]: With dead ends: 584 [2022-07-22 20:51:01,967 INFO L226 Difference]: Without dead ends: 359 [2022-07-22 20:51:01,971 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-22 20:51:01,974 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.6s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:01,975 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.6s Time] [2022-07-22 20:51:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-07-22 20:51:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 316. [2022-07-22 20:51:02,037 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-22 20:51:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 452 transitions. [2022-07-22 20:51:02,040 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 452 transitions. Word has length 58 [2022-07-22 20:51:02,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:02,041 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 452 transitions. [2022-07-22 20:51:02,041 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-22 20:51:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 452 transitions. [2022-07-22 20:51:02,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-22 20:51:02,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:02,044 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-22 20:51:02,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 20:51:02,045 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:02,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:02,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1940005051, now seen corresponding path program 1 times [2022-07-22 20:51:02,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:02,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394567566] [2022-07-22 20:51:02,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:02,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:02,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:02,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:02,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:02,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:02,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:02,154 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-22 20:51:02,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:02,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394567566] [2022-07-22 20:51:02,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394567566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:02,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:02,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:51:02,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962399886] [2022-07-22 20:51:02,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:02,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:51:02,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:02,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:51:02,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:51:02,158 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-22 20:51:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:02,890 INFO L93 Difference]: Finished difference Result 667 states and 960 transitions. [2022-07-22 20:51:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 20:51:02,890 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-22 20:51:02,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:02,895 INFO L225 Difference]: With dead ends: 667 [2022-07-22 20:51:02,895 INFO L226 Difference]: Without dead ends: 472 [2022-07-22 20:51:02,897 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-22 20:51:02,898 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.6s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:02,898 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.6s Time] [2022-07-22 20:51:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-22 20:51:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 406. [2022-07-22 20:51:02,932 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-22 20:51:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 579 transitions. [2022-07-22 20:51:02,935 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 579 transitions. Word has length 58 [2022-07-22 20:51:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:02,936 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 579 transitions. [2022-07-22 20:51:02,936 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-22 20:51:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 579 transitions. [2022-07-22 20:51:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-22 20:51:02,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:02,939 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-22 20:51:02,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 20:51:02,939 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:02,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:02,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1046518713, now seen corresponding path program 1 times [2022-07-22 20:51:02,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:02,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3464916] [2022-07-22 20:51:02,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:02,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:02,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:02,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:03,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:03,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:03,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:03,051 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-22 20:51:03,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:03,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3464916] [2022-07-22 20:51:03,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3464916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:03,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:03,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:51:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793158705] [2022-07-22 20:51:03,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:03,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:51:03,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:03,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:51:03,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:51:03,055 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-22 20:51:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:03,449 INFO L93 Difference]: Finished difference Result 753 states and 1087 transitions. [2022-07-22 20:51:03,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 20:51:03,450 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-22 20:51:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:03,455 INFO L225 Difference]: With dead ends: 753 [2022-07-22 20:51:03,455 INFO L226 Difference]: Without dead ends: 468 [2022-07-22 20:51:03,461 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-22 20:51:03,464 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.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:03,465 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.3s Time] [2022-07-22 20:51:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-07-22 20:51:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 406. [2022-07-22 20:51:03,506 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-22 20:51:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 576 transitions. [2022-07-22 20:51:03,525 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 576 transitions. Word has length 58 [2022-07-22 20:51:03,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:03,525 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 576 transitions. [2022-07-22 20:51:03,525 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-22 20:51:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 576 transitions. [2022-07-22 20:51:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-22 20:51:03,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:03,532 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-22 20:51:03,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 20:51:03,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:03,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:03,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1199060741, now seen corresponding path program 1 times [2022-07-22 20:51:03,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:03,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122906560] [2022-07-22 20:51:03,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:03,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:03,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:03,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:03,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:03,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:03,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:03,644 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-22 20:51:03,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:03,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122906560] [2022-07-22 20:51:03,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122906560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:03,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:03,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:51:03,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47827406] [2022-07-22 20:51:03,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:03,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:51:03,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:03,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:51:03,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:51:03,656 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-22 20:51:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:04,263 INFO L93 Difference]: Finished difference Result 789 states and 1144 transitions. [2022-07-22 20:51:04,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 20:51:04,264 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-22 20:51:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:04,267 INFO L225 Difference]: With dead ends: 789 [2022-07-22 20:51:04,267 INFO L226 Difference]: Without dead ends: 505 [2022-07-22 20:51:04,268 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-22 20:51:04,269 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 285 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:04,270 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.4s Time] [2022-07-22 20:51:04,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-22 20:51:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 415. [2022-07-22 20:51:04,291 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-22 20:51:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 585 transitions. [2022-07-22 20:51:04,293 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 585 transitions. Word has length 58 [2022-07-22 20:51:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:04,294 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 585 transitions. [2022-07-22 20:51:04,294 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-22 20:51:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 585 transitions. [2022-07-22 20:51:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-22 20:51:04,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:04,296 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-22 20:51:04,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 20:51:04,296 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:04,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:04,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1044922557, now seen corresponding path program 1 times [2022-07-22 20:51:04,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:04,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617007694] [2022-07-22 20:51:04,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:04,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:04,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:04,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:04,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:04,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:04,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:04,420 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-22 20:51:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:04,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617007694] [2022-07-22 20:51:04,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617007694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:04,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:04,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:51:04,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492558243] [2022-07-22 20:51:04,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:04,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:51:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:04,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:51:04,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:51:04,423 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-22 20:51:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:05,443 INFO L93 Difference]: Finished difference Result 1587 states and 2310 transitions. [2022-07-22 20:51:05,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 20:51:05,444 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-22 20:51:05,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:05,451 INFO L225 Difference]: With dead ends: 1587 [2022-07-22 20:51:05,452 INFO L226 Difference]: Without dead ends: 1294 [2022-07-22 20:51:05,454 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-22 20:51:05,455 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 1080 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:05,455 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.7s Time] [2022-07-22 20:51:05,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2022-07-22 20:51:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1123. [2022-07-22 20:51:05,532 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-22 20:51:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1569 transitions. [2022-07-22 20:51:05,538 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1569 transitions. Word has length 58 [2022-07-22 20:51:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:05,539 INFO L495 AbstractCegarLoop]: Abstraction has 1123 states and 1569 transitions. [2022-07-22 20:51:05,539 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-22 20:51:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1569 transitions. [2022-07-22 20:51:05,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:51:05,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:05,540 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-22 20:51:05,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 20:51:05,541 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:05,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:05,542 INFO L85 PathProgramCache]: Analyzing trace with hash 863362558, now seen corresponding path program 1 times [2022-07-22 20:51:05,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:05,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246974408] [2022-07-22 20:51:05,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:05,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:51:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:51:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:51:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,614 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-22 20:51:05,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:05,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246974408] [2022-07-22 20:51:05,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246974408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:05,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:05,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 20:51:05,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777693073] [2022-07-22 20:51:05,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:05,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 20:51:05,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:05,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 20:51:05,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:05,617 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-22 20:51:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:06,242 INFO L93 Difference]: Finished difference Result 1378 states and 1939 transitions. [2022-07-22 20:51:06,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 20:51:06,243 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-22 20:51:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:06,250 INFO L225 Difference]: With dead ends: 1378 [2022-07-22 20:51:06,250 INFO L226 Difference]: Without dead ends: 1274 [2022-07-22 20:51:06,251 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-22 20:51:06,252 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-22 20:51:06,252 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-22 20:51:06,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2022-07-22 20:51:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1235. [2022-07-22 20:51:06,322 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-22 20:51:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1727 transitions. [2022-07-22 20:51:06,350 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1727 transitions. Word has length 65 [2022-07-22 20:51:06,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:06,350 INFO L495 AbstractCegarLoop]: Abstraction has 1235 states and 1727 transitions. [2022-07-22 20:51:06,350 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-22 20:51:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1727 transitions. [2022-07-22 20:51:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:51:06,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:06,352 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-22 20:51:06,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 20:51:06,352 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:06,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:06,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1752716098, now seen corresponding path program 1 times [2022-07-22 20:51:06,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:06,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306407028] [2022-07-22 20:51:06,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:06,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:51:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:51:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:51:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,426 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-22 20:51:06,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:06,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306407028] [2022-07-22 20:51:06,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306407028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:06,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:06,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 20:51:06,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164207759] [2022-07-22 20:51:06,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:06,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 20:51:06,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:06,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 20:51:06,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:06,429 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-22 20:51:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:07,300 INFO L93 Difference]: Finished difference Result 1632 states and 2293 transitions. [2022-07-22 20:51:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 20:51:07,301 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-22 20:51:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:07,308 INFO L225 Difference]: With dead ends: 1632 [2022-07-22 20:51:07,308 INFO L226 Difference]: Without dead ends: 1423 [2022-07-22 20:51:07,310 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-22 20:51:07,311 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 617 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:07,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1225 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-22 20:51:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2022-07-22 20:51:07,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1347. [2022-07-22 20:51:07,391 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-22 20:51:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1887 transitions. [2022-07-22 20:51:07,399 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1887 transitions. Word has length 65 [2022-07-22 20:51:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:07,399 INFO L495 AbstractCegarLoop]: Abstraction has 1347 states and 1887 transitions. [2022-07-22 20:51:07,399 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-22 20:51:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1887 transitions. [2022-07-22 20:51:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:51:07,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:07,401 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-22 20:51:07,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 20:51:07,402 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:07,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:07,402 INFO L85 PathProgramCache]: Analyzing trace with hash 513665088, now seen corresponding path program 1 times [2022-07-22 20:51:07,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:07,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834486971] [2022-07-22 20:51:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:07,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:07,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:07,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:07,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:07,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:51:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:07,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:51:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:07,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:51:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:07,512 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-22 20:51:07,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:07,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834486971] [2022-07-22 20:51:07,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834486971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:07,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:07,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 20:51:07,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268438898] [2022-07-22 20:51:07,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:07,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 20:51:07,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:07,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 20:51:07,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:51:07,515 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-22 20:51:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:09,203 INFO L93 Difference]: Finished difference Result 2893 states and 4085 transitions. [2022-07-22 20:51:09,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 20:51:09,204 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-22 20:51:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:09,216 INFO L225 Difference]: With dead ends: 2893 [2022-07-22 20:51:09,216 INFO L226 Difference]: Without dead ends: 2560 [2022-07-22 20:51:09,220 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-22 20:51:09,220 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-22 20:51:09,221 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-22 20:51:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2022-07-22 20:51:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2400. [2022-07-22 20:51:09,345 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-22 20:51:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3274 transitions. [2022-07-22 20:51:09,356 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3274 transitions. Word has length 65 [2022-07-22 20:51:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:09,357 INFO L495 AbstractCegarLoop]: Abstraction has 2400 states and 3274 transitions. [2022-07-22 20:51:09,357 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-22 20:51:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3274 transitions. [2022-07-22 20:51:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 20:51:09,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:09,359 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-22 20:51:09,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 20:51:09,359 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:09,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:09,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2024207263, now seen corresponding path program 1 times [2022-07-22 20:51:09,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:09,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621403293] [2022-07-22 20:51:09,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:09,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 20:51:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 20:51:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,468 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-22 20:51:09,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:09,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621403293] [2022-07-22 20:51:09,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621403293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:09,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:09,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 20:51:09,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289738383] [2022-07-22 20:51:09,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:09,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 20:51:09,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:09,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 20:51:09,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:51:09,471 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-22 20:51:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:10,154 INFO L93 Difference]: Finished difference Result 3928 states and 5353 transitions. [2022-07-22 20:51:10,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 20:51:10,155 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-22 20:51:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:10,167 INFO L225 Difference]: With dead ends: 3928 [2022-07-22 20:51:10,168 INFO L226 Difference]: Without dead ends: 2548 [2022-07-22 20:51:10,172 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-22 20:51:10,173 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 227 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:10,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1407 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 20:51:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2022-07-22 20:51:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2440. [2022-07-22 20:51:10,328 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-22 20:51:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3308 transitions. [2022-07-22 20:51:10,339 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3308 transitions. Word has length 66 [2022-07-22 20:51:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:10,339 INFO L495 AbstractCegarLoop]: Abstraction has 2440 states and 3308 transitions. [2022-07-22 20:51:10,339 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-22 20:51:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3308 transitions. [2022-07-22 20:51:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 20:51:10,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:10,341 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-22 20:51:10,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 20:51:10,341 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:10,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash 994847965, now seen corresponding path program 1 times [2022-07-22 20:51:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:10,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202720072] [2022-07-22 20:51:10,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:10,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:10,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:10,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:10,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:10,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:10,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 20:51:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:10,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 20:51:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:10,416 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-22 20:51:10,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:10,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202720072] [2022-07-22 20:51:10,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202720072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:10,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:10,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 20:51:10,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596341024] [2022-07-22 20:51:10,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:10,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 20:51:10,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:10,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 20:51:10,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:51:10,418 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-22 20:51:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:12,089 INFO L93 Difference]: Finished difference Result 6012 states and 8182 transitions. [2022-07-22 20:51:12,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 20:51:12,090 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-22 20:51:12,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:12,103 INFO L225 Difference]: With dead ends: 6012 [2022-07-22 20:51:12,103 INFO L226 Difference]: Without dead ends: 2831 [2022-07-22 20:51:12,112 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-22 20:51:12,113 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-22 20:51:12,114 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-22 20:51:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2022-07-22 20:51:12,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2651. [2022-07-22 20:51:12,262 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-22 20:51:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3520 transitions. [2022-07-22 20:51:12,271 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3520 transitions. Word has length 66 [2022-07-22 20:51:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:12,271 INFO L495 AbstractCegarLoop]: Abstraction has 2651 states and 3520 transitions. [2022-07-22 20:51:12,271 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-22 20:51:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3520 transitions. [2022-07-22 20:51:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-22 20:51:12,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:12,274 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-22 20:51:12,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 20:51:12,275 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:12,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:12,276 INFO L85 PathProgramCache]: Analyzing trace with hash 457439213, now seen corresponding path program 1 times [2022-07-22 20:51:12,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:12,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670905406] [2022-07-22 20:51:12,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:12,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 20:51:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 20:51:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 20:51:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,386 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-22 20:51:12,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:12,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670905406] [2022-07-22 20:51:12,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670905406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:12,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:12,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 20:51:12,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273078360] [2022-07-22 20:51:12,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:12,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 20:51:12,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:12,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 20:51:12,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:51:12,389 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-22 20:51:13,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:13,051 INFO L93 Difference]: Finished difference Result 4476 states and 5922 transitions. [2022-07-22 20:51:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 20:51:13,052 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-22 20:51:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:13,066 INFO L225 Difference]: With dead ends: 4476 [2022-07-22 20:51:13,067 INFO L226 Difference]: Without dead ends: 2845 [2022-07-22 20:51:13,072 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-22 20:51:13,073 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 219 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:13,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1355 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 20:51:13,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2022-07-22 20:51:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2711. [2022-07-22 20:51:13,234 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-22 20:51:13,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3574 transitions. [2022-07-22 20:51:13,242 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3574 transitions. Word has length 91 [2022-07-22 20:51:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:13,243 INFO L495 AbstractCegarLoop]: Abstraction has 2711 states and 3574 transitions. [2022-07-22 20:51:13,243 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-22 20:51:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3574 transitions. [2022-07-22 20:51:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-22 20:51:13,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:13,247 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-22 20:51:13,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 20:51:13,247 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:13,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:13,248 INFO L85 PathProgramCache]: Analyzing trace with hash 901339887, now seen corresponding path program 1 times [2022-07-22 20:51:13,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:13,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906629677] [2022-07-22 20:51:13,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:13,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 20:51:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 20:51:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 20:51:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,333 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-22 20:51:13,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:13,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906629677] [2022-07-22 20:51:13,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906629677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:13,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:13,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:51:13,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716689085] [2022-07-22 20:51:13,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:13,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:51:13,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:13,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:51:13,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:51:13,335 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-22 20:51:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:13,835 INFO L93 Difference]: Finished difference Result 6308 states and 8282 transitions. [2022-07-22 20:51:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 20:51:13,836 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-22 20:51:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:13,857 INFO L225 Difference]: With dead ends: 6308 [2022-07-22 20:51:13,858 INFO L226 Difference]: Without dead ends: 4618 [2022-07-22 20:51:13,864 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-22 20:51:13,865 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 784 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:13,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 692 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:51:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4618 states. [2022-07-22 20:51:14,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4618 to 4398. [2022-07-22 20:51:14,143 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-22 20:51:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4398 states to 4398 states and 5732 transitions. [2022-07-22 20:51:14,157 INFO L78 Accepts]: Start accepts. Automaton has 4398 states and 5732 transitions. Word has length 91 [2022-07-22 20:51:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:14,158 INFO L495 AbstractCegarLoop]: Abstraction has 4398 states and 5732 transitions. [2022-07-22 20:51:14,158 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-22 20:51:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 4398 states and 5732 transitions. [2022-07-22 20:51:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-22 20:51:14,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:14,162 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-22 20:51:14,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 20:51:14,163 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:14,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash -156498191, now seen corresponding path program 1 times [2022-07-22 20:51:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:14,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823567382] [2022-07-22 20:51:14,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 20:51:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 20:51:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 20:51:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,220 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-22 20:51:14,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:14,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823567382] [2022-07-22 20:51:14,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823567382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:14,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:14,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:51:14,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596382525] [2022-07-22 20:51:14,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:14,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:51:14,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:14,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:51:14,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:51:14,223 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-22 20:51:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:14,578 INFO L93 Difference]: Finished difference Result 6206 states and 8000 transitions. [2022-07-22 20:51:14,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 20:51:14,578 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-22 20:51:14,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:14,593 INFO L225 Difference]: With dead ends: 6206 [2022-07-22 20:51:14,594 INFO L226 Difference]: Without dead ends: 2829 [2022-07-22 20:51:14,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:51:14,603 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-22 20:51:14,604 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-22 20:51:14,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2022-07-22 20:51:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2711. [2022-07-22 20:51:14,782 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-22 20:51:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3531 transitions. [2022-07-22 20:51:14,790 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3531 transitions. Word has length 91 [2022-07-22 20:51:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:14,790 INFO L495 AbstractCegarLoop]: Abstraction has 2711 states and 3531 transitions. [2022-07-22 20:51:14,791 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-22 20:51:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3531 transitions. [2022-07-22 20:51:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-22 20:51:14,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:14,794 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-22 20:51:14,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 20:51:14,794 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash 435090271, now seen corresponding path program 1 times [2022-07-22 20:51:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:14,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532168458] [2022-07-22 20:51:14,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:14,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 20:51:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 20:51:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 20:51:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,877 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-22 20:51:14,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:14,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532168458] [2022-07-22 20:51:14,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532168458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:14,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:14,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 20:51:14,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410244007] [2022-07-22 20:51:14,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:14,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 20:51:14,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:14,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 20:51:14,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:51:14,879 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-22 20:51:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:15,967 INFO L93 Difference]: Finished difference Result 5520 states and 7110 transitions. [2022-07-22 20:51:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-22 20:51:15,968 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-22 20:51:15,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:15,982 INFO L225 Difference]: With dead ends: 5520 [2022-07-22 20:51:15,983 INFO L226 Difference]: Without dead ends: 3525 [2022-07-22 20:51:15,988 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-22 20:51:15,989 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 1228 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:15,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 1232 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-22 20:51:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2022-07-22 20:51:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 3348. [2022-07-22 20:51:16,188 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-22 20:51:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3348 states to 3348 states and 4290 transitions. [2022-07-22 20:51:16,197 INFO L78 Accepts]: Start accepts. Automaton has 3348 states and 4290 transitions. Word has length 92 [2022-07-22 20:51:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:16,197 INFO L495 AbstractCegarLoop]: Abstraction has 3348 states and 4290 transitions. [2022-07-22 20:51:16,197 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-22 20:51:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3348 states and 4290 transitions. [2022-07-22 20:51:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-22 20:51:16,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:16,200 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-22 20:51:16,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 20:51:16,201 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:16,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:16,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1866213314, now seen corresponding path program 1 times [2022-07-22 20:51:16,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:16,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953180787] [2022-07-22 20:51:16,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:16,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 20:51:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 20:51:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,298 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-22 20:51:16,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:16,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953180787] [2022-07-22 20:51:16,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953180787] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:16,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061448895] [2022-07-22 20:51:16,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:16,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:16,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:16,300 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-22 20:51:16,301 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-22 20:51:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:51:16,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:16,445 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-22 20:51:16,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:16,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061448895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:16,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:16,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:51:16,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444987136] [2022-07-22 20:51:16,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:16,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:16,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:16,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:16,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:16,448 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-22 20:51:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:16,632 INFO L93 Difference]: Finished difference Result 5241 states and 6949 transitions. [2022-07-22 20:51:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:16,632 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-22 20:51:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:16,646 INFO L225 Difference]: With dead ends: 5241 [2022-07-22 20:51:16,646 INFO L226 Difference]: Without dead ends: 3594 [2022-07-22 20:51:16,652 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-22 20:51:16,653 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-22 20:51:16,653 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-22 20:51:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2022-07-22 20:51:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3594. [2022-07-22 20:51:16,899 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-22 20:51:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 4624 transitions. [2022-07-22 20:51:16,910 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 4624 transitions. Word has length 93 [2022-07-22 20:51:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:16,910 INFO L495 AbstractCegarLoop]: Abstraction has 3594 states and 4624 transitions. [2022-07-22 20:51:16,911 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-22 20:51:16,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 4624 transitions. [2022-07-22 20:51:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-22 20:51:16,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:16,915 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-22 20:51:16,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 20:51:17,131 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-22 20:51:17,132 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:17,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:17,132 INFO L85 PathProgramCache]: Analyzing trace with hash -287830492, now seen corresponding path program 1 times [2022-07-22 20:51:17,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:17,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115297474] [2022-07-22 20:51:17,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:17,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 20:51:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-22 20:51:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 20:51:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,243 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-22 20:51:17,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:17,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115297474] [2022-07-22 20:51:17,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115297474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:17,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015452262] [2022-07-22 20:51:17,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:17,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:17,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:17,245 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-22 20:51:17,246 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-22 20:51:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:51:17,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:17,444 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-22 20:51:17,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:17,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015452262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:17,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:17,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-22 20:51:17,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930228381] [2022-07-22 20:51:17,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:17,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:17,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:17,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:17,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:17,446 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-22 20:51:17,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:17,656 INFO L93 Difference]: Finished difference Result 5345 states and 7099 transitions. [2022-07-22 20:51:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:17,656 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-22 20:51:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:17,681 INFO L225 Difference]: With dead ends: 5345 [2022-07-22 20:51:17,682 INFO L226 Difference]: Without dead ends: 4330 [2022-07-22 20:51:17,686 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-22 20:51:17,686 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-22 20:51:17,686 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-22 20:51:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2022-07-22 20:51:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 4302. [2022-07-22 20:51:17,901 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-22 20:51:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 5592 transitions. [2022-07-22 20:51:17,912 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 5592 transitions. Word has length 119 [2022-07-22 20:51:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:17,912 INFO L495 AbstractCegarLoop]: Abstraction has 4302 states and 5592 transitions. [2022-07-22 20:51:17,913 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-22 20:51:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 5592 transitions. [2022-07-22 20:51:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 20:51:17,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:17,918 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-22 20:51:17,946 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-22 20:51:18,131 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-22 20:51:18,132 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:18,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1068470771, now seen corresponding path program 1 times [2022-07-22 20:51:18,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:18,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083746048] [2022-07-22 20:51:18,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:18,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 20:51:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 20:51:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 20:51:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 20:51:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,231 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-22 20:51:18,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:18,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083746048] [2022-07-22 20:51:18,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083746048] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:18,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262720660] [2022-07-22 20:51:18,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:18,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:18,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:18,233 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-22 20:51:18,235 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-22 20:51:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:51:18,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:18,367 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-22 20:51:18,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:18,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262720660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:18,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:18,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:51:18,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491766408] [2022-07-22 20:51:18,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:18,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:18,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:18,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:18,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:18,369 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-22 20:51:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:18,600 INFO L93 Difference]: Finished difference Result 6564 states and 8764 transitions. [2022-07-22 20:51:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:18,601 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-22 20:51:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:18,616 INFO L225 Difference]: With dead ends: 6564 [2022-07-22 20:51:18,617 INFO L226 Difference]: Without dead ends: 4608 [2022-07-22 20:51:18,624 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-22 20:51:18,625 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-22 20:51:18,625 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-22 20:51:18,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2022-07-22 20:51:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 4542. [2022-07-22 20:51:18,891 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-22 20:51:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4542 states to 4542 states and 5758 transitions. [2022-07-22 20:51:18,901 INFO L78 Accepts]: Start accepts. Automaton has 4542 states and 5758 transitions. Word has length 135 [2022-07-22 20:51:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:18,901 INFO L495 AbstractCegarLoop]: Abstraction has 4542 states and 5758 transitions. [2022-07-22 20:51:18,901 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-22 20:51:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4542 states and 5758 transitions. [2022-07-22 20:51:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 20:51:18,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:18,906 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-22 20:51:18,930 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-22 20:51:19,127 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-22 20:51:19,128 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1809607182, now seen corresponding path program 1 times [2022-07-22 20:51:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:19,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237384390] [2022-07-22 20:51:19,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:19,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 20:51:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 20:51:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 20:51:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 20:51:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,206 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-22 20:51:19,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:19,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237384390] [2022-07-22 20:51:19,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237384390] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:19,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190459936] [2022-07-22 20:51:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:19,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:19,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:19,209 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-22 20:51:19,210 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-22 20:51:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 20:51:19,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:19,319 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-22 20:51:19,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:19,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190459936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:19,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:19,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:51:19,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446982562] [2022-07-22 20:51:19,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:19,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:19,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:19,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:19,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:19,322 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-22 20:51:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:19,559 INFO L93 Difference]: Finished difference Result 6787 states and 8719 transitions. [2022-07-22 20:51:19,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:19,560 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-22 20:51:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:19,575 INFO L225 Difference]: With dead ends: 6787 [2022-07-22 20:51:19,575 INFO L226 Difference]: Without dead ends: 4593 [2022-07-22 20:51:19,582 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-22 20:51:19,583 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-22 20:51:19,583 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-22 20:51:19,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2022-07-22 20:51:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4524. [2022-07-22 20:51:19,862 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-22 20:51:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 5686 transitions. [2022-07-22 20:51:19,875 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 5686 transitions. Word has length 135 [2022-07-22 20:51:19,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:19,875 INFO L495 AbstractCegarLoop]: Abstraction has 4524 states and 5686 transitions. [2022-07-22 20:51:19,876 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-22 20:51:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 5686 transitions. [2022-07-22 20:51:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-22 20:51:19,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:19,881 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-22 20:51:19,905 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-22 20:51:20,104 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-22 20:51:20,105 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:20,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:20,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1867127916, now seen corresponding path program 1 times [2022-07-22 20:51:20,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:20,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761653492] [2022-07-22 20:51:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:20,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 20:51:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:51:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 20:51:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 20:51:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,187 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-22 20:51:20,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:20,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761653492] [2022-07-22 20:51:20,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761653492] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:20,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207423407] [2022-07-22 20:51:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:20,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:20,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:20,190 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-22 20:51:20,192 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-22 20:51:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 20:51:20,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:20,346 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-22 20:51:20,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:20,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207423407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:20,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:20,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:51:20,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244367919] [2022-07-22 20:51:20,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:20,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:20,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:20,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:20,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:20,351 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-22 20:51:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:20,542 INFO L93 Difference]: Finished difference Result 5468 states and 6974 transitions. [2022-07-22 20:51:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:20,543 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-22 20:51:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:20,555 INFO L225 Difference]: With dead ends: 5468 [2022-07-22 20:51:20,555 INFO L226 Difference]: Without dead ends: 4360 [2022-07-22 20:51:20,560 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-22 20:51:20,561 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-22 20:51:20,561 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-22 20:51:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2022-07-22 20:51:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 4320. [2022-07-22 20:51:20,809 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-22 20:51:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4320 states to 4320 states and 5387 transitions. [2022-07-22 20:51:20,820 INFO L78 Accepts]: Start accepts. Automaton has 4320 states and 5387 transitions. Word has length 136 [2022-07-22 20:51:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:20,820 INFO L495 AbstractCegarLoop]: Abstraction has 4320 states and 5387 transitions. [2022-07-22 20:51:20,821 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-22 20:51:20,821 INFO L276 IsEmpty]: Start isEmpty. Operand 4320 states and 5387 transitions. [2022-07-22 20:51:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-22 20:51:20,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:20,825 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-22 20:51:20,850 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-22 20:51:21,039 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-22 20:51:21,040 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:21,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash -895196586, now seen corresponding path program 1 times [2022-07-22 20:51:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:21,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147513358] [2022-07-22 20:51:21,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 20:51:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:51:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 20:51:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:51:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,124 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-22 20:51:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:21,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147513358] [2022-07-22 20:51:21,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147513358] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:21,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349035361] [2022-07-22 20:51:21,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:21,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:21,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:21,127 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-22 20:51:21,128 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-22 20:51:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 20:51:21,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:21,313 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-22 20:51:21,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:21,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349035361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:21,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:21,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-22 20:51:21,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004419921] [2022-07-22 20:51:21,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:21,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:51:21,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:21,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:51:21,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:51:21,317 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-22 20:51:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:21,793 INFO L93 Difference]: Finished difference Result 5678 states and 7141 transitions. [2022-07-22 20:51:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 20:51:21,794 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-22 20:51:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:21,809 INFO L225 Difference]: With dead ends: 5678 [2022-07-22 20:51:21,810 INFO L226 Difference]: Without dead ends: 4313 [2022-07-22 20:51:21,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:51:21,817 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-22 20:51:21,817 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-22 20:51:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2022-07-22 20:51:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 3744. [2022-07-22 20:51:22,055 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-22 20:51:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 4613 transitions. [2022-07-22 20:51:22,066 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 4613 transitions. Word has length 137 [2022-07-22 20:51:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:22,067 INFO L495 AbstractCegarLoop]: Abstraction has 3744 states and 4613 transitions. [2022-07-22 20:51:22,067 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-22 20:51:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 4613 transitions. [2022-07-22 20:51:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-22 20:51:22,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:22,071 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-22 20:51:22,099 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-22 20:51:22,296 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-22 20:51:22,297 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:22,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1533062036, now seen corresponding path program 1 times [2022-07-22 20:51:22,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:22,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768894080] [2022-07-22 20:51:22,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:22,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 20:51:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:51:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 20:51:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:51:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,380 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-22 20:51:22,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:22,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768894080] [2022-07-22 20:51:22,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768894080] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:22,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869242578] [2022-07-22 20:51:22,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:22,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:22,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:22,383 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-22 20:51:22,384 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-22 20:51:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 20:51:22,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:22,542 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-22 20:51:22,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:22,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869242578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:22,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:22,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-22 20:51:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700697308] [2022-07-22 20:51:22,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:22,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:51:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:51:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:51:22,545 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-22 20:51:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:22,950 INFO L93 Difference]: Finished difference Result 4876 states and 6006 transitions. [2022-07-22 20:51:22,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 20:51:22,951 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-22 20:51:22,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:22,961 INFO L225 Difference]: With dead ends: 4876 [2022-07-22 20:51:22,961 INFO L226 Difference]: Without dead ends: 3480 [2022-07-22 20:51:22,965 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-22 20:51:22,965 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-22 20:51:22,966 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-22 20:51:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2022-07-22 20:51:23,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3458. [2022-07-22 20:51:23,228 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-22 20:51:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4194 transitions. [2022-07-22 20:51:23,236 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4194 transitions. Word has length 137 [2022-07-22 20:51:23,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:23,236 INFO L495 AbstractCegarLoop]: Abstraction has 3458 states and 4194 transitions. [2022-07-22 20:51:23,236 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-22 20:51:23,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4194 transitions. [2022-07-22 20:51:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-22 20:51:23,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:23,240 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-22 20:51:23,266 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-22 20:51:23,464 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-22 20:51:23,464 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:23,464 INFO L85 PathProgramCache]: Analyzing trace with hash 225919638, now seen corresponding path program 1 times [2022-07-22 20:51:23,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:23,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621493169] [2022-07-22 20:51:23,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:23,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 20:51:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:51:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 20:51:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:51:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,539 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-22 20:51:23,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:23,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621493169] [2022-07-22 20:51:23,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621493169] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:23,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441639672] [2022-07-22 20:51:23,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:23,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:23,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:23,544 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-22 20:51:23,545 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-22 20:51:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 20:51:23,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:23,676 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-22 20:51:23,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:23,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441639672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:23,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:23,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-22 20:51:23,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452691747] [2022-07-22 20:51:23,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:23,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:51:23,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:23,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:51:23,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:51:23,679 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-22 20:51:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:23,913 INFO L93 Difference]: Finished difference Result 4597 states and 5591 transitions. [2022-07-22 20:51:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 20:51:23,913 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-22 20:51:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:23,924 INFO L225 Difference]: With dead ends: 4597 [2022-07-22 20:51:23,924 INFO L226 Difference]: Without dead ends: 3486 [2022-07-22 20:51:23,928 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-22 20:51:23,929 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-22 20:51:23,929 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-22 20:51:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2022-07-22 20:51:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3470. [2022-07-22 20:51:24,204 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-22 20:51:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 4185 transitions. [2022-07-22 20:51:24,212 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 4185 transitions. Word has length 137 [2022-07-22 20:51:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:24,212 INFO L495 AbstractCegarLoop]: Abstraction has 3470 states and 4185 transitions. [2022-07-22 20:51:24,212 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-22 20:51:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 4185 transitions. [2022-07-22 20:51:24,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-22 20:51:24,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:24,216 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-22 20:51:24,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-22 20:51:24,439 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-22 20:51:24,440 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:24,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1775392230, now seen corresponding path program 1 times [2022-07-22 20:51:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:24,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033625793] [2022-07-22 20:51:24,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:24,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 20:51:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:51:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 20:51:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:51:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,528 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-22 20:51:24,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:24,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033625793] [2022-07-22 20:51:24,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033625793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:24,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:24,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:51:24,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763637664] [2022-07-22 20:51:24,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:24,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:51:24,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:24,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:51:24,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:51:24,531 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-22 20:51:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:25,378 INFO L93 Difference]: Finished difference Result 4448 states and 5284 transitions. [2022-07-22 20:51:25,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 20:51:25,379 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-22 20:51:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:25,393 INFO L225 Difference]: With dead ends: 4448 [2022-07-22 20:51:25,393 INFO L226 Difference]: Without dead ends: 4445 [2022-07-22 20:51:25,396 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-22 20:51:25,397 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-22 20:51:25,397 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-22 20:51:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states. [2022-07-22 20:51:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 4174. [2022-07-22 20:51:25,727 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-22 20:51:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 4982 transitions. [2022-07-22 20:51:25,736 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 4982 transitions. Word has length 137 [2022-07-22 20:51:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:25,737 INFO L495 AbstractCegarLoop]: Abstraction has 4174 states and 4982 transitions. [2022-07-22 20:51:25,737 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-22 20:51:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 4982 transitions. [2022-07-22 20:51:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-22 20:51:25,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:25,741 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-22 20:51:25,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-22 20:51:25,741 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1319300478, now seen corresponding path program 1 times [2022-07-22 20:51:25,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:25,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65820665] [2022-07-22 20:51:25,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:25,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:51:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:51:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:51:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 20:51:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:51:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 20:51:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:51:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,799 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-22 20:51:25,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:25,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65820665] [2022-07-22 20:51:25,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65820665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:25,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:25,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 20:51:25,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765246709] [2022-07-22 20:51:25,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:25,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:51:25,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:25,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:51:25,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 20:51:25,801 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-22 20:51:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:26,337 INFO L93 Difference]: Finished difference Result 5929 states and 7136 transitions. [2022-07-22 20:51:26,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 20:51:26,338 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-22 20:51:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:26,354 INFO L225 Difference]: With dead ends: 5929 [2022-07-22 20:51:26,354 INFO L226 Difference]: Without dead ends: 4691 [2022-07-22 20:51:26,361 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-22 20:51:26,362 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 252 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:26,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 804 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:51:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2022-07-22 20:51:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 4176. [2022-07-22 20:51:26,673 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-22 20:51:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 4984 transitions. [2022-07-22 20:51:26,683 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 4984 transitions. Word has length 141 [2022-07-22 20:51:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:26,684 INFO L495 AbstractCegarLoop]: Abstraction has 4176 states and 4984 transitions. [2022-07-22 20:51:26,684 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-22 20:51:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 4984 transitions. [2022-07-22 20:51:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-22 20:51:26,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:26,688 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-22 20:51:26,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-22 20:51:26,688 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:26,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:26,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1014498838, now seen corresponding path program 1 times [2022-07-22 20:51:26,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:26,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580433293] [2022-07-22 20:51:26,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:26,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 20:51:26,701 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 20:51:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 20:51:26,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 20:51:26,760 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 20:51:26,761 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-22 20:51:26,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-22 20:51:26,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-22 20:51:26,765 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-22 20:51:26,769 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 20:51:26,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 08:51:26 BoogieIcfgContainer [2022-07-22 20:51:26,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 20:51:26,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 20:51:26,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 20:51:26,911 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 20:51:26,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:51:00" (3/4) ... [2022-07-22 20:51:26,913 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 20:51:27,035 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 20:51:27,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 20:51:27,036 INFO L158 Benchmark]: Toolchain (without parser) took 27525.59ms. Allocated memory was 100.7MB in the beginning and 914.4MB in the end (delta: 813.7MB). Free memory was 69.0MB in the beginning and 803.1MB in the end (delta: -734.1MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2022-07-22 20:51:27,036 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory was 55.6MB in the beginning and 55.5MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 20:51:27,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.71ms. Allocated memory is still 100.7MB. Free memory was 68.7MB in the beginning and 70.9MB in the end (delta: -2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 20:51:27,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.50ms. Allocated memory is still 100.7MB. Free memory was 70.9MB in the beginning and 68.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 20:51:27,039 INFO L158 Benchmark]: Boogie Preprocessor took 55.46ms. Allocated memory is still 100.7MB. Free memory was 68.1MB in the beginning and 65.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 20:51:27,039 INFO L158 Benchmark]: RCFGBuilder took 618.63ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 65.8MB in the beginning and 89.6MB in the end (delta: -23.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2022-07-22 20:51:27,041 INFO L158 Benchmark]: TraceAbstraction took 26277.91ms. Allocated memory was 121.6MB in the beginning and 914.4MB in the end (delta: 792.7MB). Free memory was 89.3MB in the beginning and 819.9MB in the end (delta: -730.6MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2022-07-22 20:51:27,041 INFO L158 Benchmark]: Witness Printer took 124.72ms. Allocated memory is still 914.4MB. Free memory was 819.9MB in the beginning and 803.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-22 20:51:27,049 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.21ms. Allocated memory is still 100.7MB. Free memory was 55.6MB in the beginning and 55.5MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.71ms. Allocated memory is still 100.7MB. Free memory was 68.7MB in the beginning and 70.9MB in the end (delta: -2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.50ms. Allocated memory is still 100.7MB. Free memory was 70.9MB in the beginning and 68.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.46ms. Allocated memory is still 100.7MB. Free memory was 68.1MB in the beginning and 65.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 618.63ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 65.8MB in the beginning and 89.6MB in the end (delta: -23.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26277.91ms. Allocated memory was 121.6MB in the beginning and 914.4MB in the end (delta: 792.7MB). Free memory was 89.3MB in the beginning and 819.9MB in the end (delta: -730.6MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. * Witness Printer took 124.72ms. Allocated memory is still 914.4MB. Free memory was 819.9MB in the beginning and 803.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.1s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14091 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13773 mSDsluCounter, 22568 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14502 mSDsCounter, 3486 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12134 IncrementalHoareTripleChecker+Invalid, 15620 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3486 mSolverCounterUnsat, 8066 mSDtfsCounter, 12134 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1806 GetRequests, 1491 SyntacticMatches, 2 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 2.6s 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.5s 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-22 20:51:27,094 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