./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 16:19:28,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 16:19:28,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 16:19:28,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 16:19:28,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 16:19:28,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 16:19:28,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 16:19:28,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 16:19:28,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 16:19:28,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 16:19:28,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 16:19:28,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 16:19:28,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 16:19:28,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 16:19:28,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 16:19:28,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 16:19:28,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 16:19:28,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 16:19:28,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 16:19:28,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 16:19:28,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 16:19:28,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 16:19:28,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 16:19:28,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 16:19:28,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 16:19:28,688 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 16:19:28,688 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 16:19:28,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 16:19:28,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 16:19:28,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 16:19:28,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 16:19:28,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 16:19:28,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 16:19:28,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 16:19:28,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 16:19:28,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 16:19:28,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 16:19:28,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 16:19:28,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 16:19:28,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 16:19:28,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 16:19:28,693 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 16:19:28,709 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 16:19:28,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 16:19:28,710 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 16:19:28,711 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 16:19:28,711 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 16:19:28,712 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 16:19:28,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 16:19:28,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 16:19:28,712 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 16:19:28,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 16:19:28,713 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 16:19:28,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 16:19:28,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 16:19:28,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 16:19:28,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 16:19:28,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 16:19:28,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 16:19:28,714 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 16:19:28,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 16:19:28,714 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 16:19:28,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 16:19:28,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 16:19:28,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 16:19:28,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 16:19:28,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:19:28,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 16:19:28,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 16:19:28,716 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 16:19:28,716 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 16:19:28,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 16:19:28,716 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 16:19:28,716 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 16:19:28,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 16:19:28,717 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 16:19:28,717 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 -> 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 [2021-12-14 16:19:28,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 16:19:28,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 16:19:28,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 16:19:28,902 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 16:19:28,902 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 16:19:28,903 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2021-12-14 16:19:28,953 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf1e211b/585550d49edd482aaecc08e6c97e1f96/FLAG569381f24 [2021-12-14 16:19:29,356 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 16:19:29,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2021-12-14 16:19:29,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf1e211b/585550d49edd482aaecc08e6c97e1f96/FLAG569381f24 [2021-12-14 16:19:29,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf1e211b/585550d49edd482aaecc08e6c97e1f96 [2021-12-14 16:19:29,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 16:19:29,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 16:19:29,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 16:19:29,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 16:19:29,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 16:19:29,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:19:29" (1/1) ... [2021-12-14 16:19:29,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bb6058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:19:29, skipping insertion in model container [2021-12-14 16:19:29,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:19:29" (1/1) ... [2021-12-14 16:19:29,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 16:19:29,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 16:19:29,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[914,927] [2021-12-14 16:19:29,595 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[7125,7138] [2021-12-14 16:19:29,616 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:19:29,622 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 16:19:29,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[914,927] [2021-12-14 16:19:29,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[7125,7138] [2021-12-14 16:19:29,655 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:19:29,667 INFO L208 MainTranslator]: Completed translation [2021-12-14 16:19:29,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:19:29 WrapperNode [2021-12-14 16:19:29,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 16:19:29,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 16:19:29,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 16:19:29,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 16:19:29,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:19:29" (1/1) ... [2021-12-14 16:19:29,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:19:29" (1/1) ... [2021-12-14 16:19:29,713 INFO L137 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 403 [2021-12-14 16:19:29,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 16:19:29,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 16:19:29,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 16:19:29,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 16:19:29,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:19:29" (1/1) ... [2021-12-14 16:19:29,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:19:29" (1/1) ... [2021-12-14 16:19:29,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:19:29" (1/1) ... [2021-12-14 16:19:29,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:19:29" (1/1) ... [2021-12-14 16:19:29,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:19:29" (1/1) ... [2021-12-14 16:19:29,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:19:29" (1/1) ... [2021-12-14 16:19:29,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:19:29" (1/1) ... [2021-12-14 16:19:29,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 16:19:29,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 16:19:29,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 16:19:29,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 16:19:29,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:19:29" (1/1) ... [2021-12-14 16:19:29,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:19:29,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:19:29,785 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) [2021-12-14 16:19:29,799 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 [2021-12-14 16:19:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 16:19:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-14 16:19:29,824 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-14 16:19:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-14 16:19:29,825 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-14 16:19:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-14 16:19:29,826 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-14 16:19:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-14 16:19:29,826 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-14 16:19:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-14 16:19:29,826 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-14 16:19:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-14 16:19:29,826 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-14 16:19:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-14 16:19:29,827 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-14 16:19:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-14 16:19:29,827 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-14 16:19:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-14 16:19:29,827 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-14 16:19:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-14 16:19:29,827 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-14 16:19:29,828 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-14 16:19:29,828 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-14 16:19:29,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 16:19:29,828 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-14 16:19:29,828 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-14 16:19:29,828 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-14 16:19:29,828 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-14 16:19:29,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 16:19:29,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 16:19:29,829 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-14 16:19:29,829 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-14 16:19:29,934 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 16:19:29,936 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 16:19:30,242 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 16:19:30,247 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 16:19:30,248 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-14 16:19:30,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:19:30 BoogieIcfgContainer [2021-12-14 16:19:30,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 16:19:30,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 16:19:30,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 16:19:30,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 16:19:30,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:19:29" (1/3) ... [2021-12-14 16:19:30,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fb1c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:19:30, skipping insertion in model container [2021-12-14 16:19:30,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:19:29" (2/3) ... [2021-12-14 16:19:30,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fb1c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:19:30, skipping insertion in model container [2021-12-14 16:19:30,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:19:30" (3/3) ... [2021-12-14 16:19:30,255 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2021-12-14 16:19:30,259 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 16:19:30,259 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 16:19:30,291 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 16:19:30,300 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 16:19:30,301 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-14 16:19:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 169 states have internal predecessors, (248), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2021-12-14 16:19:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-14 16:19:30,322 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:19:30,323 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:19:30,323 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:19:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:19:30,327 INFO L85 PathProgramCache]: Analyzing trace with hash 740240985, now seen corresponding path program 1 times [2021-12-14 16:19:30,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:19:30,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765867602] [2021-12-14 16:19:30,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:19:30,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:19:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:30,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:19:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:30,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:19:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:30,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:19:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:30,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:19:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:30,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:19:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:19:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:19:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:19:30,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:19:30,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765867602] [2021-12-14 16:19:30,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765867602] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:19:30,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:19:30,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:19:30,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58846507] [2021-12-14 16:19:30,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:19:30,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:19:30,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:19:30,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:19:30,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:19:30,673 INFO L87 Difference]: Start difference. First operand has 209 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 169 states have internal predecessors, (248), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 16:19:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:19:31,355 INFO L93 Difference]: Finished difference Result 537 states and 798 transitions. [2021-12-14 16:19:31,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:19:31,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-14 16:19:31,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:19:31,373 INFO L225 Difference]: With dead ends: 537 [2021-12-14 16:19:31,373 INFO L226 Difference]: Without dead ends: 335 [2021-12-14 16:19:31,378 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:19:31,381 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 664 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 16:19:31,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 861 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 16:19:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-12-14 16:19:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 295. [2021-12-14 16:19:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 237 states have internal predecessors, (325), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2021-12-14 16:19:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 409 transitions. [2021-12-14 16:19:31,440 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 409 transitions. Word has length 59 [2021-12-14 16:19:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:19:31,441 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 409 transitions. [2021-12-14 16:19:31,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 16:19:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 409 transitions. [2021-12-14 16:19:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-14 16:19:31,444 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:19:31,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:19:31,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 16:19:31,444 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:19:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:19:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1502890616, now seen corresponding path program 1 times [2021-12-14 16:19:31,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:19:31,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637305309] [2021-12-14 16:19:31,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:19:31,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:19:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:31,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:19:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:31,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:19:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:31,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:19:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:31,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:19:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:31,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:19:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:31,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:19:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:31,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:19:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:19:31,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:19:31,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637305309] [2021-12-14 16:19:31,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637305309] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:19:31,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:19:31,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:19:31,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907193655] [2021-12-14 16:19:31,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:19:31,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:19:31,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:19:31,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:19:31,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:19:31,536 INFO L87 Difference]: Start difference. First operand 295 states and 409 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 16:19:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:19:32,131 INFO L93 Difference]: Finished difference Result 644 states and 888 transitions. [2021-12-14 16:19:32,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 16:19:32,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-14 16:19:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:19:32,135 INFO L225 Difference]: With dead ends: 644 [2021-12-14 16:19:32,135 INFO L226 Difference]: Without dead ends: 466 [2021-12-14 16:19:32,136 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:19:32,137 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 573 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 16:19:32,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [594 Valid, 1260 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 16:19:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-12-14 16:19:32,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 391. [2021-12-14 16:19:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 306 states have (on average 1.4019607843137254) internal successors, (429), 315 states have internal predecessors, (429), 52 states have call successors, (52), 28 states have call predecessors, (52), 31 states have return successors, (62), 51 states have call predecessors, (62), 49 states have call successors, (62) [2021-12-14 16:19:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 543 transitions. [2021-12-14 16:19:32,169 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 543 transitions. Word has length 59 [2021-12-14 16:19:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:19:32,169 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 543 transitions. [2021-12-14 16:19:32,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 16:19:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 543 transitions. [2021-12-14 16:19:32,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-14 16:19:32,173 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:19:32,174 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:19:32,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 16:19:32,174 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:19:32,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:19:32,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1898590342, now seen corresponding path program 1 times [2021-12-14 16:19:32,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:19:32,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693666225] [2021-12-14 16:19:32,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:19:32,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:19:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:19:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:19:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:19:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:19:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:19:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:19:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:19:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:19:32,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:19:32,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693666225] [2021-12-14 16:19:32,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693666225] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:19:32,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:19:32,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:19:32,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786094608] [2021-12-14 16:19:32,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:19:32,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:19:32,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:19:32,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:19:32,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:19:32,305 INFO L87 Difference]: Start difference. First operand 391 states and 543 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 16:19:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:19:32,732 INFO L93 Difference]: Finished difference Result 693 states and 958 transitions. [2021-12-14 16:19:32,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:19:32,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-14 16:19:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:19:32,736 INFO L225 Difference]: With dead ends: 693 [2021-12-14 16:19:32,736 INFO L226 Difference]: Without dead ends: 425 [2021-12-14 16:19:32,740 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:19:32,743 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 210 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 16:19:32,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 1337 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 16:19:32,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-12-14 16:19:32,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 396. [2021-12-14 16:19:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 310 states have (on average 1.3903225806451613) internal successors, (431), 319 states have internal predecessors, (431), 52 states have call successors, (52), 28 states have call predecessors, (52), 32 states have return successors, (63), 52 states have call predecessors, (63), 49 states have call successors, (63) [2021-12-14 16:19:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 546 transitions. [2021-12-14 16:19:32,780 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 546 transitions. Word has length 59 [2021-12-14 16:19:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:19:32,780 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 546 transitions. [2021-12-14 16:19:32,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 16:19:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 546 transitions. [2021-12-14 16:19:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-14 16:19:32,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:19:32,785 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:19:32,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 16:19:32,786 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:19:32,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:19:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1623830728, now seen corresponding path program 1 times [2021-12-14 16:19:32,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:19:32,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479971746] [2021-12-14 16:19:32,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:19:32,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:19:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:19:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:19:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:19:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:19:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:19:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:19:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:19:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:19:32,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:19:32,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479971746] [2021-12-14 16:19:32,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479971746] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:19:32,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:19:32,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:19:32,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906208518] [2021-12-14 16:19:32,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:19:32,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:19:32,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:19:32,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:19:32,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:19:32,920 INFO L87 Difference]: Start difference. First operand 396 states and 546 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 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) [2021-12-14 16:19:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:19:34,141 INFO L93 Difference]: Finished difference Result 2064 states and 2824 transitions. [2021-12-14 16:19:34,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-14 16:19:34,141 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2021-12-14 16:19:34,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:19:34,147 INFO L225 Difference]: With dead ends: 2064 [2021-12-14 16:19:34,148 INFO L226 Difference]: Without dead ends: 1791 [2021-12-14 16:19:34,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2021-12-14 16:19:34,150 INFO L933 BasicCegarLoop]: 492 mSDtfsCounter, 1332 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 16:19:34,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1350 Valid, 1537 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-14 16:19:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2021-12-14 16:19:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1533. [2021-12-14 16:19:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1207 states have (on average 1.3305716652858326) internal successors, (1606), 1236 states have internal predecessors, (1606), 169 states have call successors, (169), 130 states have call predecessors, (169), 155 states have return successors, (249), 170 states have call predecessors, (249), 166 states have call successors, (249) [2021-12-14 16:19:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2024 transitions. [2021-12-14 16:19:34,217 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2024 transitions. Word has length 59 [2021-12-14 16:19:34,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:19:34,217 INFO L470 AbstractCegarLoop]: Abstraction has 1533 states and 2024 transitions. [2021-12-14 16:19:34,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 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) [2021-12-14 16:19:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2024 transitions. [2021-12-14 16:19:34,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-14 16:19:34,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:19:34,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:19:34,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 16:19:34,219 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:19:34,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:19:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1699461881, now seen corresponding path program 1 times [2021-12-14 16:19:34,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:19:34,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194497570] [2021-12-14 16:19:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:19:34,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:19:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:19:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:19:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:19:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:19:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:19:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:19:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:19:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:19:34,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:19:34,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194497570] [2021-12-14 16:19:34,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194497570] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:19:34,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:19:34,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:19:34,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638596396] [2021-12-14 16:19:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:19:34,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:19:34,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:19:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:19:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:19:34,304 INFO L87 Difference]: Start difference. First operand 1533 states and 2024 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 16:19:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:19:34,785 INFO L93 Difference]: Finished difference Result 3132 states and 4143 transitions. [2021-12-14 16:19:34,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 16:19:34,785 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-14 16:19:34,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:19:34,792 INFO L225 Difference]: With dead ends: 3132 [2021-12-14 16:19:34,792 INFO L226 Difference]: Without dead ends: 1722 [2021-12-14 16:19:34,795 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:19:34,796 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 208 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 16:19:34,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 1330 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 16:19:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2021-12-14 16:19:34,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1578. [2021-12-14 16:19:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1243 states have (on average 1.3137570394207563) internal successors, (1633), 1272 states have internal predecessors, (1633), 169 states have call successors, (169), 130 states have call predecessors, (169), 164 states have return successors, (261), 179 states have call predecessors, (261), 166 states have call successors, (261) [2021-12-14 16:19:34,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2063 transitions. [2021-12-14 16:19:34,856 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2063 transitions. Word has length 59 [2021-12-14 16:19:34,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:19:34,856 INFO L470 AbstractCegarLoop]: Abstraction has 1578 states and 2063 transitions. [2021-12-14 16:19:34,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 16:19:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2063 transitions. [2021-12-14 16:19:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-14 16:19:34,858 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:19:34,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:19:34,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 16:19:34,858 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:19:34,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:19:34,859 INFO L85 PathProgramCache]: Analyzing trace with hash -105976453, now seen corresponding path program 1 times [2021-12-14 16:19:34,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:19:34,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144934671] [2021-12-14 16:19:34,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:19:34,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:19:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:19:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:19:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:19:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:19:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:19:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:19:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:19:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:19:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:19:34,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:19:34,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144934671] [2021-12-14 16:19:34,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144934671] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:19:34,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:19:34,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:19:34,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578315070] [2021-12-14 16:19:34,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:19:34,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:19:34,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:19:34,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:19:34,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:19:34,927 INFO L87 Difference]: Start difference. First operand 1578 states and 2063 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 16:19:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:19:35,535 INFO L93 Difference]: Finished difference Result 3013 states and 3900 transitions. [2021-12-14 16:19:35,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 16:19:35,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-14 16:19:35,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:19:35,543 INFO L225 Difference]: With dead ends: 3013 [2021-12-14 16:19:35,543 INFO L226 Difference]: Without dead ends: 1777 [2021-12-14 16:19:35,546 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:19:35,547 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 558 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 16:19:35,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 978 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 16:19:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2021-12-14 16:19:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1556. [2021-12-14 16:19:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1229 states have (on average 1.309194467046379) internal successors, (1609), 1252 states have internal predecessors, (1609), 169 states have call successors, (169), 130 states have call predecessors, (169), 156 states have return successors, (245), 177 states have call predecessors, (245), 166 states have call successors, (245) [2021-12-14 16:19:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2023 transitions. [2021-12-14 16:19:35,605 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2023 transitions. Word has length 59 [2021-12-14 16:19:35,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:19:35,606 INFO L470 AbstractCegarLoop]: Abstraction has 1556 states and 2023 transitions. [2021-12-14 16:19:35,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 16:19:35,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2023 transitions. [2021-12-14 16:19:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-14 16:19:35,607 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:19:35,607 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:19:35,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 16:19:35,607 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:19:35,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:19:35,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2100121159, now seen corresponding path program 1 times [2021-12-14 16:19:35,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:19:35,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345889177] [2021-12-14 16:19:35,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:19:35,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:19:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:19:35,615 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 16:19:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:19:35,639 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 16:19:35,639 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 16:19:35,640 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-14 16:19:35,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-14 16:19:35,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 16:19:35,644 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:19:35,646 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 16:19:35,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:19:35 BoogieIcfgContainer [2021-12-14 16:19:35,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 16:19:35,701 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 16:19:35,701 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 16:19:35,701 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 16:19:35,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:19:30" (3/4) ... [2021-12-14 16:19:35,703 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 16:19:35,762 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 16:19:35,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 16:19:35,763 INFO L158 Benchmark]: Toolchain (without parser) took 6367.50ms. Allocated memory was 115.3MB in the beginning and 188.7MB in the end (delta: 73.4MB). Free memory was 82.1MB in the beginning and 150.8MB in the end (delta: -68.7MB). Peak memory consumption was 107.4MB. Max. memory is 16.1GB. [2021-12-14 16:19:35,764 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 73.4MB. Free memory is still 31.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 16:19:35,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.63ms. Allocated memory is still 115.3MB. Free memory was 81.9MB in the beginning and 85.8MB in the end (delta: -3.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 16:19:35,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.63ms. Allocated memory is still 115.3MB. Free memory was 85.8MB in the beginning and 83.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:19:35,765 INFO L158 Benchmark]: Boogie Preprocessor took 22.06ms. Allocated memory is still 115.3MB. Free memory was 83.3MB in the beginning and 81.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:19:35,765 INFO L158 Benchmark]: RCFGBuilder took 512.50ms. Allocated memory is still 115.3MB. Free memory was 81.2MB in the beginning and 58.7MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-14 16:19:35,765 INFO L158 Benchmark]: TraceAbstraction took 5450.13ms. Allocated memory was 115.3MB in the beginning and 188.7MB in the end (delta: 73.4MB). Free memory was 58.1MB in the beginning and 56.4MB in the end (delta: 1.7MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. [2021-12-14 16:19:35,765 INFO L158 Benchmark]: Witness Printer took 61.70ms. Allocated memory is still 188.7MB. Free memory was 56.4MB in the beginning and 150.8MB in the end (delta: -94.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 16:19:35,766 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.17ms. Allocated memory is still 73.4MB. Free memory is still 31.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.63ms. Allocated memory is still 115.3MB. Free memory was 81.9MB in the beginning and 85.8MB in the end (delta: -3.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.63ms. Allocated memory is still 115.3MB. Free memory was 85.8MB in the beginning and 83.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.06ms. Allocated memory is still 115.3MB. Free memory was 83.3MB in the beginning and 81.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 512.50ms. Allocated memory is still 115.3MB. Free memory was 81.2MB in the beginning and 58.7MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5450.13ms. Allocated memory was 115.3MB in the beginning and 188.7MB in the end (delta: 73.4MB). Free memory was 58.1MB in the beginning and 56.4MB in the end (delta: 1.7MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. * Witness Printer took 61.70ms. Allocated memory is still 188.7MB. Free memory was 56.4MB in the beginning and 150.8MB in the end (delta: -94.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L962] COND TRUE __VERIFIER_nondet_int() [L963] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 209 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3609 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3545 mSDsluCounter, 7303 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5371 mSDsCounter, 1079 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4354 IncrementalHoareTripleChecker+Invalid, 5433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1079 mSolverCounterUnsat, 1932 mSDtfsCounter, 4354 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1578occurred in iteration=5, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 767 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-14 16:19:35,800 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