./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.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 53db286b74a116c4cb3fd4f087c7d403ff5102019365af3310fff7597395a239 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:14:25,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:14:25,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:14:25,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:14:25,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:14:25,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:14:25,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:14:25,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:14:25,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:14:25,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:14:25,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:14:25,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:14:25,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:14:25,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:14:25,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:14:25,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:14:25,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:14:25,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:14:25,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:14:25,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:14:25,492 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:14:25,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:14:25,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:14:25,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:14:25,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:14:25,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:14:25,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:14:25,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:14:25,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:14:25,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:14:25,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:14:25,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:14:25,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:14:25,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:14:25,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:14:25,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:14:25,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:14:25,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:14:25,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:14:25,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:14:25,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:14:25,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:14:25,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:14:25,537 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:14:25,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:14:25,538 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:14:25,538 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:14:25,539 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:14:25,539 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:14:25,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:14:25,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:14:25,540 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:14:25,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:14:25,541 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:14:25,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:14:25,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:14:25,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:14:25,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:14:25,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:14:25,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:14:25,542 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:14:25,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:14:25,544 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:14:25,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:14:25,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:14:25,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:14:25,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:14:25,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:14:25,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:14:25,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:14:25,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:14:25,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:14:25,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:14:25,546 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:14:25,546 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:14:25,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:14:25,546 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 -> 53db286b74a116c4cb3fd4f087c7d403ff5102019365af3310fff7597395a239 [2022-07-13 21:14:25,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:14:25,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:14:25,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:14:25,796 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:14:25,797 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:14:25,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2022-07-13 21:14:25,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31dd381a3/1d150ab7355f4638a620f1253cf935f9/FLAG5d43a00dc [2022-07-13 21:14:26,347 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:14:26,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2022-07-13 21:14:26,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31dd381a3/1d150ab7355f4638a620f1253cf935f9/FLAG5d43a00dc [2022-07-13 21:14:26,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31dd381a3/1d150ab7355f4638a620f1253cf935f9 [2022-07-13 21:14:26,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:14:26,849 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:14:26,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:14:26,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:14:26,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:14:26,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:14:26" (1/1) ... [2022-07-13 21:14:26,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e323cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:26, skipping insertion in model container [2022-07-13 21:14:26,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:14:26" (1/1) ... [2022-07-13 21:14:26,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:14:26,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:14:27,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[914,927] [2022-07-13 21:14:27,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[7125,7138] [2022-07-13 21:14:27,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:14:27,137 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:14:27,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[914,927] [2022-07-13 21:14:27,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[7125,7138] [2022-07-13 21:14:27,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:14:27,262 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:14:27,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:27 WrapperNode [2022-07-13 21:14:27,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:14:27,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:14:27,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:14:27,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:14:27,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:27" (1/1) ... [2022-07-13 21:14:27,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:27" (1/1) ... [2022-07-13 21:14:27,343 INFO L137 Inliner]: procedures = 63, calls = 73, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 635 [2022-07-13 21:14:27,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:14:27,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:14:27,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:14:27,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:14:27,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:27" (1/1) ... [2022-07-13 21:14:27,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:27" (1/1) ... [2022-07-13 21:14:27,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:27" (1/1) ... [2022-07-13 21:14:27,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:27" (1/1) ... [2022-07-13 21:14:27,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:27" (1/1) ... [2022-07-13 21:14:27,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:27" (1/1) ... [2022-07-13 21:14:27,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:27" (1/1) ... [2022-07-13 21:14:27,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:14:27,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:14:27,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:14:27,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:14:27,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:27" (1/1) ... [2022-07-13 21:14:27,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:14:27,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:14:27,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 21:14:27,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 21:14:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:14:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-13 21:14:27,457 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-13 21:14:27,458 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-13 21:14:27,458 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-13 21:14:27,458 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-13 21:14:27,458 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-13 21:14:27,458 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-13 21:14:27,458 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-13 21:14:27,459 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-13 21:14:27,459 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-13 21:14:27,459 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-13 21:14:27,459 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-13 21:14:27,459 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-13 21:14:27,460 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-13 21:14:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-13 21:14:27,460 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-13 21:14:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-13 21:14:27,460 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-13 21:14:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-13 21:14:27,461 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-13 21:14:27,461 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-13 21:14:27,461 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-13 21:14:27,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:14:27,461 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-13 21:14:27,461 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-13 21:14:27,462 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-13 21:14:27,462 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-13 21:14:27,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:14:27,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:14:27,462 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-13 21:14:27,462 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-13 21:14:27,616 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:14:27,617 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:14:28,237 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:14:28,250 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:14:28,254 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-07-13 21:14:28,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:14:28 BoogieIcfgContainer [2022-07-13 21:14:28,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:14:28,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:14:28,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:14:28,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:14:28,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:14:26" (1/3) ... [2022-07-13 21:14:28,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1681242b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:14:28, skipping insertion in model container [2022-07-13 21:14:28,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:27" (2/3) ... [2022-07-13 21:14:28,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1681242b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:14:28, skipping insertion in model container [2022-07-13 21:14:28,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:14:28" (3/3) ... [2022-07-13 21:14:28,268 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2022-07-13 21:14:28,281 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:14:28,282 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:14:28,345 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:14:28,352 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@5e77e6b8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@28e8757f [2022-07-13 21:14:28,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-13 21:14:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 265 states have internal predecessors, (412), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-07-13 21:14:28,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 21:14:28,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:28,369 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] [2022-07-13 21:14:28,369 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:28,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:28,374 INFO L85 PathProgramCache]: Analyzing trace with hash 961710808, now seen corresponding path program 1 times [2022-07-13 21:14:28,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:28,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621226565] [2022-07-13 21:14:28,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:28,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:28,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:28,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:14:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:28,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:14:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:28,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:14:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:28,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:14:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:28,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:14:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:28,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:14:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:28,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:14:28,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:28,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621226565] [2022-07-13 21:14:28,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621226565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:28,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:28,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:14:28,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806649078] [2022-07-13 21:14:28,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:28,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:14:28,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:28,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:14:28,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:14:28,752 INFO L87 Difference]: Start difference. First operand has 309 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 265 states have internal predecessors, (412), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:14:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:29,385 INFO L93 Difference]: Finished difference Result 615 states and 953 transitions. [2022-07-13 21:14:29,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 21:14:29,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 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 59 [2022-07-13 21:14:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:29,410 INFO L225 Difference]: With dead ends: 615 [2022-07-13 21:14:29,410 INFO L226 Difference]: Without dead ends: 317 [2022-07-13 21:14:29,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 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-13 21:14:29,421 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 647 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:29,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1002 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:14:29,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-13 21:14:29,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 299. [2022-07-13 21:14:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-13 21:14:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 440 transitions. [2022-07-13 21:14:29,519 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 440 transitions. Word has length 59 [2022-07-13 21:14:29,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:29,520 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 440 transitions. [2022-07-13 21:14:29,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:14:29,520 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 440 transitions. [2022-07-13 21:14:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 21:14:29,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:29,530 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] [2022-07-13 21:14:29,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:14:29,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:29,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:29,534 INFO L85 PathProgramCache]: Analyzing trace with hash 977229526, now seen corresponding path program 1 times [2022-07-13 21:14:29,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:29,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265363974] [2022-07-13 21:14:29,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:29,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:29,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:29,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:14:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:29,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:14:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:14:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:29,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:14:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:29,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:14:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:29,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:14:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:14:29,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:29,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265363974] [2022-07-13 21:14:29,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265363974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:29,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:29,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:14:29,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760806200] [2022-07-13 21:14:29,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:29,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:14:29,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:29,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:14:29,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:14:29,748 INFO L87 Difference]: Start difference. First operand 299 states and 440 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:14:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:30,495 INFO L93 Difference]: Finished difference Result 524 states and 756 transitions. [2022-07-13 21:14:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:14:30,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-07-13 21:14:30,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:30,501 INFO L225 Difference]: With dead ends: 524 [2022-07-13 21:14:30,501 INFO L226 Difference]: Without dead ends: 435 [2022-07-13 21:14:30,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-13 21:14:30,503 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 784 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:30,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1440 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 21:14:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-07-13 21:14:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 395. [2022-07-13 21:14:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-07-13 21:14:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions. [2022-07-13 21:14:30,552 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 59 [2022-07-13 21:14:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:30,553 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 571 transitions. [2022-07-13 21:14:30,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:14:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions. [2022-07-13 21:14:30,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 21:14:30,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:30,555 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] [2022-07-13 21:14:30,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:14:30,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:30,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:30,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1739879157, now seen corresponding path program 1 times [2022-07-13 21:14:30,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:30,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432938922] [2022-07-13 21:14:30,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:30,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:30,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:14:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:30,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:14:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:30,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:14:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:30,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:14:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:30,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:14:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:30,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:14:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:14:30,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:30,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432938922] [2022-07-13 21:14:30,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432938922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:30,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:30,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:14:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013880816] [2022-07-13 21:14:30,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:30,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:14:30,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:30,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:14:30,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:14:30,682 INFO L87 Difference]: Start difference. First operand 395 states and 571 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:14:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:31,510 INFO L93 Difference]: Finished difference Result 744 states and 1049 transitions. [2022-07-13 21:14:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 21:14:31,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2022-07-13 21:14:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:31,514 INFO L225 Difference]: With dead ends: 744 [2022-07-13 21:14:31,514 INFO L226 Difference]: Without dead ends: 566 [2022-07-13 21:14:31,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-13 21:14:31,516 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 1105 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:31,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 1507 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 21:14:31,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-07-13 21:14:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 491. [2022-07-13 21:14:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 411 states have internal predecessors, (582), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2022-07-13 21:14:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 704 transitions. [2022-07-13 21:14:31,543 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 704 transitions. Word has length 59 [2022-07-13 21:14:31,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:31,543 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 704 transitions. [2022-07-13 21:14:31,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:14:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 704 transitions. [2022-07-13 21:14:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 21:14:31,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:31,545 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] [2022-07-13 21:14:31,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:14:31,546 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:31,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:31,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1661601801, now seen corresponding path program 1 times [2022-07-13 21:14:31,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:31,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957790300] [2022-07-13 21:14:31,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:31,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:31,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:31,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:14:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:31,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:14:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:31,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:14:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:31,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:14:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:31,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:14:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:31,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:14:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:14:31,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:31,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957790300] [2022-07-13 21:14:31,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957790300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:31,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:31,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:14:31,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690876556] [2022-07-13 21:14:31,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:31,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:14:31,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:31,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:14:31,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:14:31,671 INFO L87 Difference]: Start difference. First operand 491 states and 704 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:14:32,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:32,504 INFO L93 Difference]: Finished difference Result 793 states and 1119 transitions. [2022-07-13 21:14:32,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:14:32,505 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-07-13 21:14:32,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:32,508 INFO L225 Difference]: With dead ends: 793 [2022-07-13 21:14:32,508 INFO L226 Difference]: Without dead ends: 525 [2022-07-13 21:14:32,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-13 21:14:32,510 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 548 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:32,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1714 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 21:14:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-07-13 21:14:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 496. [2022-07-13 21:14:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 406 states have (on average 1.438423645320197) internal successors, (584), 415 states have internal predecessors, (584), 56 states have call successors, (56), 28 states have call predecessors, (56), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2022-07-13 21:14:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 707 transitions. [2022-07-13 21:14:32,536 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 707 transitions. Word has length 59 [2022-07-13 21:14:32,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:32,536 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 707 transitions. [2022-07-13 21:14:32,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:14:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 707 transitions. [2022-07-13 21:14:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 21:14:32,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:32,539 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] [2022-07-13 21:14:32,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:14:32,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:32,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1386842187, now seen corresponding path program 1 times [2022-07-13 21:14:32,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:32,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726822438] [2022-07-13 21:14:32,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:32,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:32,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:32,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:14:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:32,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:14:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:32,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:14:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:32,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:14:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:32,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:14:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:32,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:14:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:14:32,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:32,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726822438] [2022-07-13 21:14:32,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726822438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:32,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:32,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:14:32,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773197202] [2022-07-13 21:14:32,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:32,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:14:32,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:32,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:14:32,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:14:32,694 INFO L87 Difference]: Start difference. First operand 496 states and 707 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:14:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:33,480 INFO L93 Difference]: Finished difference Result 815 states and 1141 transitions. [2022-07-13 21:14:33,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:14:33,481 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-07-13 21:14:33,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:33,484 INFO L225 Difference]: With dead ends: 815 [2022-07-13 21:14:33,484 INFO L226 Difference]: Without dead ends: 542 [2022-07-13 21:14:33,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-13 21:14:33,486 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 370 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:33,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1904 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 21:14:33,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-07-13 21:14:33,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 511. [2022-07-13 21:14:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 427 states have internal predecessors, (596), 56 states have call successors, (56), 28 states have call predecessors, (56), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2022-07-13 21:14:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 722 transitions. [2022-07-13 21:14:33,510 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 722 transitions. Word has length 59 [2022-07-13 21:14:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:33,510 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 722 transitions. [2022-07-13 21:14:33,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:14:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 722 transitions. [2022-07-13 21:14:33,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 21:14:33,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:33,512 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] [2022-07-13 21:14:33,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:14:33,512 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:33,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:33,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1102686775, now seen corresponding path program 1 times [2022-07-13 21:14:33,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:33,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49701014] [2022-07-13 21:14:33,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:33,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:33,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:33,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:14:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:33,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:14:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:14:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:33,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:14:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:33,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:14:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:33,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:14:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:14:33,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:33,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49701014] [2022-07-13 21:14:33,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49701014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:33,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:33,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:14:33,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780974168] [2022-07-13 21:14:33,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:33,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:14:33,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:33,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:14:33,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:14:33,638 INFO L87 Difference]: Start difference. First operand 511 states and 722 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:14:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:34,429 INFO L93 Difference]: Finished difference Result 905 states and 1235 transitions. [2022-07-13 21:14:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 21:14:34,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2022-07-13 21:14:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:34,433 INFO L225 Difference]: With dead ends: 905 [2022-07-13 21:14:34,433 INFO L226 Difference]: Without dead ends: 619 [2022-07-13 21:14:34,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-07-13 21:14:34,435 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 1072 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:34,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 1316 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 21:14:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-07-13 21:14:34,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 523. [2022-07-13 21:14:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 437 states have internal predecessors, (606), 57 states have call successors, (57), 29 states have call predecessors, (57), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2022-07-13 21:14:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 732 transitions. [2022-07-13 21:14:34,468 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 732 transitions. Word has length 59 [2022-07-13 21:14:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:34,469 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 732 transitions. [2022-07-13 21:14:34,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:14:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 732 transitions. [2022-07-13 21:14:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 21:14:34,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:34,471 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] [2022-07-13 21:14:34,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:14:34,471 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:34,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:34,471 INFO L85 PathProgramCache]: Analyzing trace with hash -891457931, now seen corresponding path program 1 times [2022-07-13 21:14:34,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:34,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393697070] [2022-07-13 21:14:34,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:34,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:14:34,492 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:14:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:14:34,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:14:34,542 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:14:34,543 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-13 21:14:34,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-13 21:14:34,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:14:34,547 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:14:34,550 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:14:34,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:14:34 BoogieIcfgContainer [2022-07-13 21:14:34,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:14:34,641 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:14:34,641 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:14:34,641 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:14:34,642 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:14:28" (3/4) ... [2022-07-13 21:14:34,643 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:14:34,711 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:14:34,711 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:14:34,712 INFO L158 Benchmark]: Toolchain (without parser) took 7863.02ms. Allocated memory was 92.3MB in the beginning and 155.2MB in the end (delta: 62.9MB). Free memory was 61.1MB in the beginning and 99.2MB in the end (delta: -38.1MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2022-07-13 21:14:34,712 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 92.3MB. Free memory was 49.9MB in the beginning and 49.8MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:14:34,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.24ms. Allocated memory was 92.3MB in the beginning and 123.7MB in the end (delta: 31.5MB). Free memory was 60.9MB in the beginning and 92.1MB in the end (delta: -31.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 21:14:34,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.82ms. Allocated memory is still 123.7MB. Free memory was 92.1MB in the beginning and 88.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 21:14:34,713 INFO L158 Benchmark]: Boogie Preprocessor took 37.70ms. Allocated memory is still 123.7MB. Free memory was 88.6MB in the beginning and 85.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:14:34,713 INFO L158 Benchmark]: RCFGBuilder took 875.63ms. Allocated memory is still 123.7MB. Free memory was 85.1MB in the beginning and 52.9MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-07-13 21:14:34,713 INFO L158 Benchmark]: TraceAbstraction took 6380.14ms. Allocated memory was 123.7MB in the beginning and 155.2MB in the end (delta: 31.5MB). Free memory was 52.2MB in the beginning and 109.7MB in the end (delta: -57.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:14:34,714 INFO L158 Benchmark]: Witness Printer took 70.06ms. Allocated memory is still 155.2MB. Free memory was 109.7MB in the beginning and 99.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 21:14:34,715 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.66ms. Allocated memory is still 92.3MB. Free memory was 49.9MB in the beginning and 49.8MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.24ms. Allocated memory was 92.3MB in the beginning and 123.7MB in the end (delta: 31.5MB). Free memory was 60.9MB in the beginning and 92.1MB in the end (delta: -31.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.82ms. Allocated memory is still 123.7MB. Free memory was 92.1MB in the beginning and 88.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.70ms. Allocated memory is still 123.7MB. Free memory was 88.6MB in the beginning and 85.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 875.63ms. Allocated memory is still 123.7MB. Free memory was 85.1MB in the beginning and 52.9MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6380.14ms. Allocated memory was 123.7MB in the beginning and 155.2MB in the end (delta: 31.5MB). Free memory was 52.2MB in the beginning and 109.7MB in the end (delta: -57.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 70.06ms. Allocated memory is still 155.2MB. Free memory was 109.7MB in the beginning and 99.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int t5_pc = 0; [L506] int m_st ; [L507] int t1_st ; [L508] int t2_st ; [L509] int t3_st ; [L510] int t4_st ; [L511] int t5_st ; [L512] int m_i ; [L513] int t1_i ; [L514] int t2_i ; [L515] int t3_i ; [L516] int t4_i ; [L517] int t5_i ; [L518] int M_E = 2; [L519] int T1_E = 2; [L520] int T2_E = 2; [L521] int T3_E = 2; [L522] int T4_E = 2; [L523] int T5_E = 2; [L524] int E_M = 2; [L525] int E_1 = 2; [L526] int E_2 = 2; [L527] int E_3 = 2; [L528] int E_4 = 2; [L529] int E_5 = 2; [L537] int token ; [L539] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L1462] COND TRUE __VERIFIER_nondet_int() [L1463] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] - UnprovableResult [Line: 496]: 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 15 procedures, 309 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4590 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4526 mSDsluCounter, 8883 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6187 mSDsCounter, 865 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5051 IncrementalHoareTripleChecker+Invalid, 5916 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 865 mSolverCounterUnsat, 2696 mSDtfsCounter, 5051 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=523occurred in iteration=6, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 289 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 21:14:34,752 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