./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/systemc/pc_sfifo_2.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 05:13:26,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 05:13:26,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 05:13:26,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 05:13:26,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 05:13:26,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 05:13:26,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 05:13:26,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 05:13:26,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 05:13:26,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 05:13:26,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 05:13:26,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 05:13:26,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 05:13:26,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 05:13:26,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 05:13:26,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 05:13:26,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 05:13:26,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 05:13:26,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 05:13:26,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 05:13:26,516 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 05:13:26,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 05:13:26,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 05:13:26,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 05:13:26,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 05:13:26,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 05:13:26,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 05:13:26,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 05:13:26,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 05:13:26,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 05:13:26,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 05:13:26,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 05:13:26,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 05:13:26,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 05:13:26,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 05:13:26,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 05:13:26,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 05:13:26,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 05:13:26,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 05:13:26,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 05:13:26,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 05:13:26,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 05:13:26,545 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 05:13:26,588 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 05:13:26,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 05:13:26,589 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 05:13:26,590 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 05:13:26,590 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 05:13:26,591 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 05:13:26,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 05:13:26,591 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 05:13:26,592 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 05:13:26,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 05:13:26,593 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 05:13:26,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 05:13:26,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 05:13:26,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 05:13:26,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 05:13:26,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 05:13:26,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 05:13:26,594 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 05:13:26,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 05:13:26,594 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 05:13:26,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 05:13:26,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 05:13:26,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 05:13:26,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 05:13:26,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:13:26,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 05:13:26,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 05:13:26,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 05:13:26,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 05:13:26,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 05:13:26,597 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 05:13:26,597 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 05:13:26,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 05:13:26,597 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 -> 5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de [2022-07-21 05:13:26,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 05:13:26,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 05:13:26,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 05:13:26,925 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 05:13:26,926 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 05:13:26,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2022-07-21 05:13:26,977 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d82c09da/e652f5f56dd7429d9f45b28b81e38c1c/FLAG47cb201a8 [2022-07-21 05:13:27,403 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 05:13:27,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2022-07-21 05:13:27,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d82c09da/e652f5f56dd7429d9f45b28b81e38c1c/FLAG47cb201a8 [2022-07-21 05:13:27,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d82c09da/e652f5f56dd7429d9f45b28b81e38c1c [2022-07-21 05:13:27,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 05:13:27,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 05:13:27,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 05:13:27,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 05:13:27,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 05:13:27,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:13:27" (1/1) ... [2022-07-21 05:13:27,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab752cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:27, skipping insertion in model container [2022-07-21 05:13:27,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:13:27" (1/1) ... [2022-07-21 05:13:27,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 05:13:27,862 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 05:13:27,984 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/systemc/pc_sfifo_2.cil-2.c[643,656] [2022-07-21 05:13:28,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:13:28,069 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 05:13:28,088 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/systemc/pc_sfifo_2.cil-2.c[643,656] [2022-07-21 05:13:28,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:13:28,168 INFO L208 MainTranslator]: Completed translation [2022-07-21 05:13:28,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:28 WrapperNode [2022-07-21 05:13:28,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 05:13:28,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 05:13:28,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 05:13:28,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 05:13:28,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:28" (1/1) ... [2022-07-21 05:13:28,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:28" (1/1) ... [2022-07-21 05:13:28,221 INFO L137 Inliner]: procedures = 29, calls = 32, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 188 [2022-07-21 05:13:28,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 05:13:28,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 05:13:28,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 05:13:28,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 05:13:28,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:28" (1/1) ... [2022-07-21 05:13:28,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:28" (1/1) ... [2022-07-21 05:13:28,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:28" (1/1) ... [2022-07-21 05:13:28,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:28" (1/1) ... [2022-07-21 05:13:28,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:28" (1/1) ... [2022-07-21 05:13:28,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:28" (1/1) ... [2022-07-21 05:13:28,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:28" (1/1) ... [2022-07-21 05:13:28,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 05:13:28,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 05:13:28,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 05:13:28,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 05:13:28,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:28" (1/1) ... [2022-07-21 05:13:28,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:13:28,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:13:28,300 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-21 05:13:28,313 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-21 05:13:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 05:13:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-07-21 05:13:28,338 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-07-21 05:13:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-21 05:13:28,338 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-21 05:13:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-21 05:13:28,338 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-21 05:13:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-21 05:13:28,339 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-21 05:13:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-21 05:13:28,339 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-21 05:13:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-21 05:13:28,339 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-21 05:13:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 05:13:28,340 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-21 05:13:28,340 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-21 05:13:28,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 05:13:28,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 05:13:28,340 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-21 05:13:28,340 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-21 05:13:28,399 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 05:13:28,401 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 05:13:28,678 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 05:13:28,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 05:13:28,685 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 05:13:28,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:13:28 BoogieIcfgContainer [2022-07-21 05:13:28,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 05:13:28,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 05:13:28,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 05:13:28,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 05:13:28,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:13:27" (1/3) ... [2022-07-21 05:13:28,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e30fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:13:28, skipping insertion in model container [2022-07-21 05:13:28,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:28" (2/3) ... [2022-07-21 05:13:28,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e30fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:13:28, skipping insertion in model container [2022-07-21 05:13:28,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:13:28" (3/3) ... [2022-07-21 05:13:28,708 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2022-07-21 05:13:28,719 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 05:13:28,719 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 05:13:28,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 05:13:28,798 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@7f2a3843, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@242973d7 [2022-07-21 05:13:28,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 05:13:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 79 states have (on average 1.518987341772152) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-21 05:13:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 05:13:28,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:13:28,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:13:28,823 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:13:28,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:13:28,830 INFO L85 PathProgramCache]: Analyzing trace with hash -651219767, now seen corresponding path program 1 times [2022-07-21 05:13:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:13:28,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116275682] [2022-07-21 05:13:28,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:13:28,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:13:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:13:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:13:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:13:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 05:13:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:13:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 05:13:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:13:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:13:29,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:13:29,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116275682] [2022-07-21 05:13:29,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116275682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:13:29,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:13:29,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 05:13:29,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016037181] [2022-07-21 05:13:29,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:13:29,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 05:13:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:13:29,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 05:13:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:13:29,221 INFO L87 Difference]: Start difference. First operand has 104 states, 79 states have (on average 1.518987341772152) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 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-21 05:13:29,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:13:29,552 INFO L93 Difference]: Finished difference Result 217 states and 317 transitions. [2022-07-21 05:13:29,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 05:13:29,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 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 58 [2022-07-21 05:13:29,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:13:29,563 INFO L225 Difference]: With dead ends: 217 [2022-07-21 05:13:29,563 INFO L226 Difference]: Without dead ends: 116 [2022-07-21 05:13:29,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-21 05:13:29,570 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 210 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:13:29,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 290 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:13:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-21 05:13:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-07-21 05:13:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-21 05:13:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2022-07-21 05:13:29,628 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 58 [2022-07-21 05:13:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:13:29,629 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2022-07-21 05:13:29,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 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-21 05:13:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2022-07-21 05:13:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 05:13:29,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:13:29,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:13:29,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 05:13:29,636 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:13:29,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:13:29,637 INFO L85 PathProgramCache]: Analyzing trace with hash -635701049, now seen corresponding path program 1 times [2022-07-21 05:13:29,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:13:29,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990709799] [2022-07-21 05:13:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:13:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:13:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:13:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:13:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:13:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 05:13:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:13:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 05:13:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:13:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:29,750 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-21 05:13:29,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:13:29,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990709799] [2022-07-21 05:13:29,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990709799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:13:29,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:13:29,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 05:13:29,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023731846] [2022-07-21 05:13:29,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:13:29,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 05:13:29,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:13:29,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 05:13:29,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:13:29,754 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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-21 05:13:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:13:30,268 INFO L93 Difference]: Finished difference Result 323 states and 448 transitions. [2022-07-21 05:13:30,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 05:13:30,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2022-07-21 05:13:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:13:30,272 INFO L225 Difference]: With dead ends: 323 [2022-07-21 05:13:30,272 INFO L226 Difference]: Without dead ends: 234 [2022-07-21 05:13:30,273 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-21 05:13:30,275 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 478 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 05:13:30,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 352 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 05:13:30,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-21 05:13:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 194. [2022-07-21 05:13:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-07-21 05:13:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2022-07-21 05:13:30,301 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 58 [2022-07-21 05:13:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:13:30,302 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2022-07-21 05:13:30,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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-21 05:13:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2022-07-21 05:13:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 05:13:30,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:13:30,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:13:30,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 05:13:30,304 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:13:30,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:13:30,305 INFO L85 PathProgramCache]: Analyzing trace with hash 126948582, now seen corresponding path program 1 times [2022-07-21 05:13:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:13:30,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161577805] [2022-07-21 05:13:30,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:13:30,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:13:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:30,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:13:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:30,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:13:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:30,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:13:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:30,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 05:13:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:30,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:13:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:30,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 05:13:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:30,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:13:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:30,412 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-21 05:13:30,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:13:30,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161577805] [2022-07-21 05:13:30,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161577805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:13:30,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:13:30,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 05:13:30,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75948999] [2022-07-21 05:13:30,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:13:30,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 05:13:30,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:13:30,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 05:13:30,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:13:30,415 INFO L87 Difference]: Start difference. First operand 194 states and 263 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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-21 05:13:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:13:31,010 INFO L93 Difference]: Finished difference Result 543 states and 741 transitions. [2022-07-21 05:13:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 05:13:31,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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 58 [2022-07-21 05:13:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:13:31,019 INFO L225 Difference]: With dead ends: 543 [2022-07-21 05:13:31,019 INFO L226 Difference]: Without dead ends: 365 [2022-07-21 05:13:31,023 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-21 05:13:31,028 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 438 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 05:13:31,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 646 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 05:13:31,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-07-21 05:13:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 290. [2022-07-21 05:13:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 234 states have internal predecessors, (312), 37 states have call successors, (37), 22 states have call predecessors, (37), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2022-07-21 05:13:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 396 transitions. [2022-07-21 05:13:31,075 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 396 transitions. Word has length 58 [2022-07-21 05:13:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:13:31,075 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 396 transitions. [2022-07-21 05:13:31,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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-21 05:13:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 396 transitions. [2022-07-21 05:13:31,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 05:13:31,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:13:31,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:13:31,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 05:13:31,078 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:13:31,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:13:31,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1020434920, now seen corresponding path program 1 times [2022-07-21 05:13:31,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:13:31,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721824828] [2022-07-21 05:13:31,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:13:31,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:13:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:13:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:13:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:13:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 05:13:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:13:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 05:13:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:13:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,236 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-21 05:13:31,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:13:31,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721824828] [2022-07-21 05:13:31,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721824828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:13:31,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:13:31,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 05:13:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422053855] [2022-07-21 05:13:31,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:13:31,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 05:13:31,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:13:31,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 05:13:31,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 05:13:31,239 INFO L87 Difference]: Start difference. First operand 290 states and 396 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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-21 05:13:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:13:31,670 INFO L93 Difference]: Finished difference Result 592 states and 811 transitions. [2022-07-21 05:13:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 05:13:31,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2022-07-21 05:13:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:13:31,674 INFO L225 Difference]: With dead ends: 592 [2022-07-21 05:13:31,675 INFO L226 Difference]: Without dead ends: 324 [2022-07-21 05:13:31,676 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-21 05:13:31,687 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 114 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 05:13:31,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 533 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 05:13:31,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-21 05:13:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 295. [2022-07-21 05:13:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 238 states have internal predecessors, (314), 37 states have call successors, (37), 22 states have call predecessors, (37), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2022-07-21 05:13:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 399 transitions. [2022-07-21 05:13:31,724 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 399 transitions. Word has length 58 [2022-07-21 05:13:31,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:13:31,726 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 399 transitions. [2022-07-21 05:13:31,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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-21 05:13:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 399 transitions. [2022-07-21 05:13:31,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 05:13:31,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:13:31,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:13:31,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 05:13:31,732 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:13:31,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:13:31,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1295194534, now seen corresponding path program 1 times [2022-07-21 05:13:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:13:31,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872269666] [2022-07-21 05:13:31,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:13:31,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:13:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:13:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:13:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:13:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 05:13:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:13:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 05:13:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:13:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:31,911 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-21 05:13:31,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:13:31,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872269666] [2022-07-21 05:13:31,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872269666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:13:31,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:13:31,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 05:13:31,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341954445] [2022-07-21 05:13:31,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:13:31,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 05:13:31,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:13:31,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 05:13:31,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 05:13:31,913 INFO L87 Difference]: Start difference. First operand 295 states and 399 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-21 05:13:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:13:33,302 INFO L93 Difference]: Finished difference Result 1963 states and 2677 transitions. [2022-07-21 05:13:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 05:13:33,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2022-07-21 05:13:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:13:33,311 INFO L225 Difference]: With dead ends: 1963 [2022-07-21 05:13:33,311 INFO L226 Difference]: Without dead ends: 1690 [2022-07-21 05:13:33,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-07-21 05:13:33,314 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 1152 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 05:13:33,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 869 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 05:13:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2022-07-21 05:13:33,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1432. [2022-07-21 05:13:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1128 states have (on average 1.3200354609929077) internal successors, (1489), 1155 states have internal predecessors, (1489), 154 states have call successors, (154), 124 states have call predecessors, (154), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2022-07-21 05:13:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1877 transitions. [2022-07-21 05:13:33,426 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1877 transitions. Word has length 58 [2022-07-21 05:13:33,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:13:33,427 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1877 transitions. [2022-07-21 05:13:33,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-21 05:13:33,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1877 transitions. [2022-07-21 05:13:33,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 05:13:33,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:13:33,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:13:33,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 05:13:33,429 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:13:33,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:13:33,430 INFO L85 PathProgramCache]: Analyzing trace with hash 323519847, now seen corresponding path program 1 times [2022-07-21 05:13:33,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:13:33,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506419972] [2022-07-21 05:13:33,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:13:33,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:13:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:33,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:13:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:33,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:13:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:33,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:13:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:33,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 05:13:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:33,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:13:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:33,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 05:13:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:33,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:13:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:33,517 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-21 05:13:33,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:13:33,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506419972] [2022-07-21 05:13:33,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506419972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:13:33,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:13:33,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 05:13:33,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512557118] [2022-07-21 05:13:33,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:13:33,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 05:13:33,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:13:33,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 05:13:33,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 05:13:33,520 INFO L87 Difference]: Start difference. First operand 1432 states and 1877 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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-21 05:13:33,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:13:33,943 INFO L93 Difference]: Finished difference Result 3031 states and 3996 transitions. [2022-07-21 05:13:33,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 05:13:33,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2022-07-21 05:13:33,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:13:33,960 INFO L225 Difference]: With dead ends: 3031 [2022-07-21 05:13:33,960 INFO L226 Difference]: Without dead ends: 1621 [2022-07-21 05:13:33,964 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-21 05:13:33,965 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 162 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:13:33,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 481 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:13:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-07-21 05:13:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1477. [2022-07-21 05:13:34,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1164 states have (on average 1.302405498281787) internal successors, (1516), 1191 states have internal predecessors, (1516), 154 states have call successors, (154), 124 states have call predecessors, (154), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2022-07-21 05:13:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1916 transitions. [2022-07-21 05:13:34,067 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1916 transitions. Word has length 58 [2022-07-21 05:13:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:13:34,068 INFO L495 AbstractCegarLoop]: Abstraction has 1477 states and 1916 transitions. [2022-07-21 05:13:34,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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-21 05:13:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1916 transitions. [2022-07-21 05:13:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 05:13:34,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:13:34,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:13:34,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 05:13:34,070 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:13:34,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:13:34,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1481918487, now seen corresponding path program 1 times [2022-07-21 05:13:34,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:13:34,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810291592] [2022-07-21 05:13:34,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:13:34,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:13:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:34,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:13:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:34,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:13:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:34,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:13:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:34,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 05:13:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:34,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:13:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:34,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 05:13:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:13:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:34,165 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-21 05:13:34,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:13:34,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810291592] [2022-07-21 05:13:34,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810291592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:13:34,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:13:34,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 05:13:34,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940170505] [2022-07-21 05:13:34,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:13:34,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 05:13:34,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:13:34,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 05:13:34,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:13:34,168 INFO L87 Difference]: Start difference. First operand 1477 states and 1916 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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-21 05:13:34,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:13:34,784 INFO L93 Difference]: Finished difference Result 2912 states and 3753 transitions. [2022-07-21 05:13:34,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 05:13:34,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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 58 [2022-07-21 05:13:34,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:13:34,792 INFO L225 Difference]: With dead ends: 2912 [2022-07-21 05:13:34,792 INFO L226 Difference]: Without dead ends: 1676 [2022-07-21 05:13:34,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-07-21 05:13:34,796 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 333 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 05:13:34,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 471 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 05:13:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2022-07-21 05:13:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1455. [2022-07-21 05:13:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1150 states have (on average 1.297391304347826) internal successors, (1492), 1171 states have internal predecessors, (1492), 154 states have call successors, (154), 124 states have call predecessors, (154), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2022-07-21 05:13:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1876 transitions. [2022-07-21 05:13:34,875 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1876 transitions. Word has length 58 [2022-07-21 05:13:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:13:34,876 INFO L495 AbstractCegarLoop]: Abstraction has 1455 states and 1876 transitions. [2022-07-21 05:13:34,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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-21 05:13:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1876 transitions. [2022-07-21 05:13:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 05:13:34,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:13:34,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:13:34,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 05:13:34,878 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:13:34,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:13:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash 818904103, now seen corresponding path program 1 times [2022-07-21 05:13:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:13:34,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159965281] [2022-07-21 05:13:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:13:34,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:13:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:13:34,887 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 05:13:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:13:34,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 05:13:34,915 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 05:13:34,916 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 05:13:34,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 05:13:34,920 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:13:34,923 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 05:13:34,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:13:34 BoogieIcfgContainer [2022-07-21 05:13:34,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 05:13:34,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 05:13:34,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 05:13:34,975 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 05:13:34,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:13:28" (3/4) ... [2022-07-21 05:13:34,976 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 05:13:35,055 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 05:13:35,055 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 05:13:35,056 INFO L158 Benchmark]: Toolchain (without parser) took 7229.64ms. Allocated memory was 54.5MB in the beginning and 125.8MB in the end (delta: 71.3MB). Free memory was 32.4MB in the beginning and 48.3MB in the end (delta: -16.0MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. [2022-07-21 05:13:35,056 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 54.5MB. Free memory was 36.0MB in the beginning and 36.0MB in the end (delta: 33.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:13:35,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.32ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 32.2MB in the beginning and 49.7MB in the end (delta: -17.5MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-07-21 05:13:35,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.09ms. Allocated memory is still 67.1MB. Free memory was 49.7MB in the beginning and 47.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 05:13:35,057 INFO L158 Benchmark]: Boogie Preprocessor took 47.96ms. Allocated memory is still 67.1MB. Free memory was 47.9MB in the beginning and 46.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:13:35,057 INFO L158 Benchmark]: RCFGBuilder took 416.89ms. Allocated memory is still 67.1MB. Free memory was 46.3MB in the beginning and 46.1MB in the end (delta: 207.2kB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2022-07-21 05:13:35,058 INFO L158 Benchmark]: TraceAbstraction took 6284.85ms. Allocated memory was 67.1MB in the beginning and 125.8MB in the end (delta: 58.7MB). Free memory was 45.8MB in the beginning and 53.6MB in the end (delta: -7.8MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2022-07-21 05:13:35,058 INFO L158 Benchmark]: Witness Printer took 81.00ms. Allocated memory is still 125.8MB. Free memory was 53.6MB in the beginning and 48.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 05:13:35,060 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.22ms. Allocated memory is still 54.5MB. Free memory was 36.0MB in the beginning and 36.0MB in the end (delta: 33.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.32ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 32.2MB in the beginning and 49.7MB in the end (delta: -17.5MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.09ms. Allocated memory is still 67.1MB. Free memory was 49.7MB in the beginning and 47.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.96ms. Allocated memory is still 67.1MB. Free memory was 47.9MB in the beginning and 46.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 416.89ms. Allocated memory is still 67.1MB. Free memory was 46.3MB in the beginning and 46.1MB in the end (delta: 207.2kB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6284.85ms. Allocated memory was 67.1MB in the beginning and 125.8MB in the end (delta: 58.7MB). Free memory was 45.8MB in the beginning and 53.6MB in the end (delta: -7.8MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. * Witness Printer took 81.00ms. Allocated memory is still 125.8MB. Free memory was 53.6MB in the beginning and 48.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int q_buf_0 ; [L26] int q_free ; [L27] int q_read_ev ; [L28] int q_write_ev ; [L29] int q_req_up ; [L30] int q_ev ; [L51] int p_num_write ; [L52] int p_last_write ; [L53] int p_dw_st ; [L54] int p_dw_pc ; [L55] int p_dw_i ; [L56] int c_num_read ; [L57] int c_last_read ; [L58] int c_dr_st ; [L59] int c_dr_pc ; [L60] int c_dr_i ; [L164] static int a_t ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0] [L466] int __retres1 ; [L470] CALL init_model() [L452] q_free = 1 [L453] q_write_ev = 2 [L454] q_read_ev = q_write_ev [L455] p_num_write = 0 [L456] p_dw_pc = 0 [L457] p_dw_i = 1 [L458] c_num_read = 0 [L459] c_dr_pc = 0 [L460] 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, 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] [L470] RET init_model() [L471] CALL start_simulation() [L406] int kernel_st ; [L407] int tmp ; [L411] 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, kernel_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] [L412] CALL update_channels() 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, 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] [L222] 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, 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] [L412] RET update_channels() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_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] [L413] CALL init_threads() [L237] COND TRUE (int )p_dw_i == 1 [L238] 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, 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] [L242] COND TRUE (int )c_dr_i == 1 [L243] 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, 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] [L413] RET init_threads() [L414] CALL fire_delta_events() 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, 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] [L275] 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, 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] [L280] 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, 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] [L414] RET fire_delta_events() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_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] [L415] CALL activate_threads() 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, 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] [L308] int tmp ; [L309] 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, 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] [L313] 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, 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] [L62] 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, 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] [L65] 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, 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] [L75] __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, 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] [L77] 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, 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] [L313] 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, is_do_write_p_triggered()=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] [L313] tmp = is_do_write_p_triggered() [L315] 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, 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, tmp=0] [L321] 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, 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] [L81] 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, 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] [L84] 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, 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] [L94] __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, 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] [L96] 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, 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] [L321] 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, is_do_read_c_triggered()=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, tmp=0] [L321] tmp___0 = is_do_read_c_triggered() [L323] 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, 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, tmp=0, tmp___0=0] [L415] RET activate_threads() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_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] [L416] CALL reset_delta_events() 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, 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] [L293] 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, 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] [L298] 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, 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] [L416] RET reset_delta_events() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_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] [L419] 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, kernel_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] [L422] kernel_st = 1 [L423] CALL eval() [L333] int tmp ; [L334] int tmp___0 ; [L335] 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, 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] [L339] 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, 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] [L342] CALL, EXPR exists_runnable_thread() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=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] [L252] 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, 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] [L255] COND TRUE (int )p_dw_st == 0 [L256] __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, 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] [L268] 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, 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] [L342] RET, EXPR exists_runnable_thread() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, exists_runnable_thread()=1, 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] [L342] tmp___1 = exists_runnable_thread() [L344] 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, 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, tmp___1=1] [L349] COND TRUE (int )p_dw_st == 0 [L351] tmp = __VERIFIER_nondet_int() [L353] 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, 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, tmp=0, tmp___1=1] [L359] CALL 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, 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] [L20] 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, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2931 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2887 mSDsluCounter, 3642 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2418 mSDsCounter, 934 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3366 IncrementalHoareTripleChecker+Invalid, 4300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 934 mSolverCounterUnsat, 1224 mSDtfsCounter, 3366 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1477occurred in iteration=6, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 785 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 399 ConstructedInterpolants, 0 QuantifiedInterpolants, 976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-21 05:13:35,108 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