./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 01:06:13,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 01:06:13,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 01:06:13,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 01:06:13,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 01:06:13,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 01:06:13,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 01:06:13,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 01:06:13,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 01:06:13,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 01:06:13,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 01:06:13,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 01:06:13,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 01:06:13,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 01:06:13,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 01:06:13,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 01:06:13,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 01:06:13,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 01:06:13,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 01:06:13,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 01:06:13,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 01:06:13,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 01:06:13,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 01:06:13,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 01:06:13,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 01:06:13,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 01:06:13,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 01:06:13,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 01:06:13,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 01:06:13,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 01:06:13,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 01:06:13,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 01:06:13,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 01:06:13,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 01:06:13,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 01:06:13,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 01:06:13,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 01:06:13,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 01:06:13,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 01:06:13,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 01:06:13,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 01:06:13,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 01:06:13,528 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 01:06:13,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 01:06:13,529 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 01:06:13,529 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 01:06:13,530 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 01:06:13,530 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 01:06:13,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 01:06:13,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 01:06:13,531 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 01:06:13,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 01:06:13,531 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 01:06:13,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 01:06:13,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 01:06:13,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 01:06:13,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 01:06:13,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 01:06:13,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 01:06:13,532 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 01:06:13,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 01:06:13,533 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 01:06:13,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 01:06:13,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 01:06:13,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 01:06:13,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 01:06:13,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:06:13,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 01:06:13,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 01:06:13,534 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 01:06:13,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 01:06:13,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 01:06:13,535 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 01:06:13,535 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 01:06:13,535 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 01:06:13,535 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 01:06:13,535 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 -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2021-12-16 01:06:13,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 01:06:13,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 01:06:13,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 01:06:13,794 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 01:06:13,795 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 01:06:13,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-12-16 01:06:13,870 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54fec328/3bfcdb92dca847ada626771a6f4dc39c/FLAGfbe3b6dc2 [2021-12-16 01:06:14,323 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 01:06:14,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-12-16 01:06:14,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54fec328/3bfcdb92dca847ada626771a6f4dc39c/FLAGfbe3b6dc2 [2021-12-16 01:06:14,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54fec328/3bfcdb92dca847ada626771a6f4dc39c [2021-12-16 01:06:14,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 01:06:14,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 01:06:14,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 01:06:14,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 01:06:14,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 01:06:14,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:06:14" (1/1) ... [2021-12-16 01:06:14,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ccf1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:14, skipping insertion in model container [2021-12-16 01:06:14,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:06:14" (1/1) ... [2021-12-16 01:06:14,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 01:06:14,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 01:06:14,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2021-12-16 01:06:14,618 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:06:14,642 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 01:06:14,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2021-12-16 01:06:14,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:06:14,720 INFO L208 MainTranslator]: Completed translation [2021-12-16 01:06:14,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:14 WrapperNode [2021-12-16 01:06:14,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 01:06:14,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 01:06:14,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 01:06:14,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 01:06:14,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:14" (1/1) ... [2021-12-16 01:06:14,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:14" (1/1) ... [2021-12-16 01:06:14,799 INFO L137 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 202 [2021-12-16 01:06:14,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 01:06:14,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 01:06:14,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 01:06:14,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 01:06:14,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:14" (1/1) ... [2021-12-16 01:06:14,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:14" (1/1) ... [2021-12-16 01:06:14,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:14" (1/1) ... [2021-12-16 01:06:14,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:14" (1/1) ... [2021-12-16 01:06:14,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:14" (1/1) ... [2021-12-16 01:06:14,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:14" (1/1) ... [2021-12-16 01:06:14,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:14" (1/1) ... [2021-12-16 01:06:14,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 01:06:14,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 01:06:14,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 01:06:14,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 01:06:14,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:14" (1/1) ... [2021-12-16 01:06:14,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:06:14,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:14,881 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-16 01:06:14,884 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-16 01:06:14,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 01:06:14,910 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-16 01:06:14,910 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-16 01:06:14,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 01:06:14,910 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-16 01:06:14,911 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-16 01:06:14,911 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2021-12-16 01:06:14,913 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2021-12-16 01:06:14,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 01:06:14,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 01:06:15,011 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 01:06:15,028 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 01:06:15,196 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 01:06:15,202 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 01:06:15,203 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-16 01:06:15,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:06:15 BoogieIcfgContainer [2021-12-16 01:06:15,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 01:06:15,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 01:06:15,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 01:06:15,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 01:06:15,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:06:14" (1/3) ... [2021-12-16 01:06:15,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fffb1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:06:15, skipping insertion in model container [2021-12-16 01:06:15,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:14" (2/3) ... [2021-12-16 01:06:15,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fffb1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:06:15, skipping insertion in model container [2021-12-16 01:06:15,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:06:15" (3/3) ... [2021-12-16 01:06:15,217 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2021-12-16 01:06:15,221 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 01:06:15,221 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 01:06:15,263 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 01:06:15,270 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-16 01:06:15,271 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 01:06:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 66 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 01:06:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 01:06:15,307 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:15,307 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] [2021-12-16 01:06:15,308 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:15,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:15,313 INFO L85 PathProgramCache]: Analyzing trace with hash -21131724, now seen corresponding path program 1 times [2021-12-16 01:06:15,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:15,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526582978] [2021-12-16 01:06:15,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:15,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:15,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 01:06:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:15,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 01:06:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:15,544 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-16 01:06:15,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:15,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526582978] [2021-12-16 01:06:15,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526582978] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:15,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:15,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:06:15,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226131529] [2021-12-16 01:06:15,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:15,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:06:15,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:15,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:06:15,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:06:15,580 INFO L87 Difference]: Start difference. First operand has 74 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 66 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-16 01:06:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:15,748 INFO L93 Difference]: Finished difference Result 214 states and 325 transitions. [2021-12-16 01:06:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:06:15,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-12-16 01:06:15,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:15,763 INFO L225 Difference]: With dead ends: 214 [2021-12-16 01:06:15,779 INFO L226 Difference]: Without dead ends: 138 [2021-12-16 01:06:15,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:06:15,785 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 104 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:15,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 267 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 01:06:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-16 01:06:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2021-12-16 01:06:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.3793103448275863) internal successors, (160), 118 states have internal predecessors, (160), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2021-12-16 01:06:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2021-12-16 01:06:15,829 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 43 [2021-12-16 01:06:15,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:15,829 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2021-12-16 01:06:15,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-16 01:06:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2021-12-16 01:06:15,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-16 01:06:15,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:15,841 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] [2021-12-16 01:06:15,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 01:06:15,841 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:15,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:15,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1928738726, now seen corresponding path program 1 times [2021-12-16 01:06:15,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:15,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029652283] [2021-12-16 01:06:15,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:15,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:15,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 01:06:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:15,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-16 01:06:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:15,916 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-16 01:06:15,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:15,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029652283] [2021-12-16 01:06:15,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029652283] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:15,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:15,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:06:15,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453675452] [2021-12-16 01:06:15,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:15,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:06:15,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:15,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:06:15,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:06:15,928 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-16 01:06:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:16,057 INFO L93 Difference]: Finished difference Result 380 states and 524 transitions. [2021-12-16 01:06:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:06:16,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2021-12-16 01:06:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:16,073 INFO L225 Difference]: With dead ends: 380 [2021-12-16 01:06:16,073 INFO L226 Difference]: Without dead ends: 256 [2021-12-16 01:06:16,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:06:16,075 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 100 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:16,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 281 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 01:06:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-12-16 01:06:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 199. [2021-12-16 01:06:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 177 states have (on average 1.3785310734463276) internal successors, (244), 179 states have internal predecessors, (244), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2021-12-16 01:06:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 274 transitions. [2021-12-16 01:06:16,100 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 274 transitions. Word has length 44 [2021-12-16 01:06:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:16,100 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 274 transitions. [2021-12-16 01:06:16,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-16 01:06:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 274 transitions. [2021-12-16 01:06:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-16 01:06:16,104 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:16,105 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] [2021-12-16 01:06:16,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 01:06:16,105 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:16,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1081871109, now seen corresponding path program 1 times [2021-12-16 01:06:16,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:16,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607923575] [2021-12-16 01:06:16,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:16,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 01:06:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-16 01:06:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,195 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-16 01:06:16,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:16,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607923575] [2021-12-16 01:06:16,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607923575] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:16,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:16,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:06:16,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130961262] [2021-12-16 01:06:16,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:16,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:06:16,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:16,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:06:16,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:06:16,202 INFO L87 Difference]: Start difference. First operand 199 states and 274 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-16 01:06:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:16,309 INFO L93 Difference]: Finished difference Result 607 states and 833 transitions. [2021-12-16 01:06:16,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:06:16,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2021-12-16 01:06:16,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:16,319 INFO L225 Difference]: With dead ends: 607 [2021-12-16 01:06:16,319 INFO L226 Difference]: Without dead ends: 416 [2021-12-16 01:06:16,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:06:16,330 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 117 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:16,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 255 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 01:06:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-12-16 01:06:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 364. [2021-12-16 01:06:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 323 states have (on average 1.3436532507739938) internal successors, (434), 328 states have internal predecessors, (434), 24 states have call successors, (24), 15 states have call predecessors, (24), 16 states have return successors, (34), 20 states have call predecessors, (34), 22 states have call successors, (34) [2021-12-16 01:06:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 492 transitions. [2021-12-16 01:06:16,378 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 492 transitions. Word has length 44 [2021-12-16 01:06:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:16,378 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 492 transitions. [2021-12-16 01:06:16,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-16 01:06:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 492 transitions. [2021-12-16 01:06:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-16 01:06:16,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:16,387 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:06:16,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 01:06:16,387 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:16,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:16,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1162995804, now seen corresponding path program 1 times [2021-12-16 01:06:16,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:16,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856757587] [2021-12-16 01:06:16,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:16,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 01:06:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 01:06:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 01:06:16,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:16,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856757587] [2021-12-16 01:06:16,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856757587] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:16,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:16,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:06:16,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946005161] [2021-12-16 01:06:16,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:16,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:06:16,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:16,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:06:16,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:06:16,435 INFO L87 Difference]: Start difference. First operand 364 states and 492 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 01:06:16,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:16,551 INFO L93 Difference]: Finished difference Result 948 states and 1277 transitions. [2021-12-16 01:06:16,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:06:16,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 61 [2021-12-16 01:06:16,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:16,555 INFO L225 Difference]: With dead ends: 948 [2021-12-16 01:06:16,555 INFO L226 Difference]: Without dead ends: 592 [2021-12-16 01:06:16,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:06:16,557 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 84 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:16,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 334 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 01:06:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-12-16 01:06:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 554. [2021-12-16 01:06:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 489 states have (on average 1.296523517382413) internal successors, (634), 496 states have internal predecessors, (634), 38 states have call successors, (38), 23 states have call predecessors, (38), 26 states have return successors, (58), 34 states have call predecessors, (58), 36 states have call successors, (58) [2021-12-16 01:06:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 730 transitions. [2021-12-16 01:06:16,591 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 730 transitions. Word has length 61 [2021-12-16 01:06:16,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:16,592 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 730 transitions. [2021-12-16 01:06:16,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 01:06:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 730 transitions. [2021-12-16 01:06:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-16 01:06:16,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:16,599 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:06:16,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 01:06:16,600 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:16,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:16,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1047893343, now seen corresponding path program 1 times [2021-12-16 01:06:16,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:16,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959538339] [2021-12-16 01:06:16,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:16,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 01:06:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:06:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-16 01:06:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 01:06:16,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:16,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959538339] [2021-12-16 01:06:16,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959538339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:16,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:16,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:06:16,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736118484] [2021-12-16 01:06:16,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:16,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:06:16,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:16,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:06:16,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:06:16,658 INFO L87 Difference]: Start difference. First operand 554 states and 730 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 01:06:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:16,741 INFO L93 Difference]: Finished difference Result 1207 states and 1583 transitions. [2021-12-16 01:06:16,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:06:16,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2021-12-16 01:06:16,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:16,746 INFO L225 Difference]: With dead ends: 1207 [2021-12-16 01:06:16,746 INFO L226 Difference]: Without dead ends: 753 [2021-12-16 01:06:16,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:06:16,749 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 104 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:16,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 252 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:06:16,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2021-12-16 01:06:16,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 698. [2021-12-16 01:06:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 617 states have (on average 1.2722852512155591) internal successors, (785), 626 states have internal predecessors, (785), 46 states have call successors, (46), 29 states have call predecessors, (46), 34 states have return successors, (72), 42 states have call predecessors, (72), 44 states have call successors, (72) [2021-12-16 01:06:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 903 transitions. [2021-12-16 01:06:16,806 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 903 transitions. Word has length 66 [2021-12-16 01:06:16,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:16,807 INFO L470 AbstractCegarLoop]: Abstraction has 698 states and 903 transitions. [2021-12-16 01:06:16,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 01:06:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 903 transitions. [2021-12-16 01:06:16,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 01:06:16,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:16,810 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:06:16,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 01:06:16,810 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:16,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1099770361, now seen corresponding path program 1 times [2021-12-16 01:06:16,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:16,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944291621] [2021-12-16 01:06:16,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:16,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 01:06:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 01:06:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 01:06:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 01:06:16,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:16,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944291621] [2021-12-16 01:06:16,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944291621] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:16,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680272656] [2021-12-16 01:06:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:16,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:16,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:16,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 01:06:16,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 01:06:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:16,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 01:06:16,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:06:17,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 01:06:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 01:06:17,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680272656] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:17,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-16 01:06:17,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2021-12-16 01:06:17,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246776717] [2021-12-16 01:06:17,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:17,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:06:17,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:17,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:06:17,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:06:17,253 INFO L87 Difference]: Start difference. First operand 698 states and 903 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 01:06:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:17,290 INFO L93 Difference]: Finished difference Result 754 states and 971 transitions. [2021-12-16 01:06:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 01:06:17,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 67 [2021-12-16 01:06:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:17,293 INFO L225 Difference]: With dead ends: 754 [2021-12-16 01:06:17,293 INFO L226 Difference]: Without dead ends: 751 [2021-12-16 01:06:17,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-16 01:06:17,294 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 173 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:17,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 185 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:06:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2021-12-16 01:06:17,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 697. [2021-12-16 01:06:17,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 617 states have (on average 1.2690437601296596) internal successors, (783), 625 states have internal predecessors, (783), 45 states have call successors, (45), 29 states have call predecessors, (45), 34 states have return successors, (72), 42 states have call predecessors, (72), 44 states have call successors, (72) [2021-12-16 01:06:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 900 transitions. [2021-12-16 01:06:17,339 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 900 transitions. Word has length 67 [2021-12-16 01:06:17,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:17,340 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 900 transitions. [2021-12-16 01:06:17,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 01:06:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 900 transitions. [2021-12-16 01:06:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-16 01:06:17,342 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:17,342 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:06:17,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-16 01:06:17,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-16 01:06:17,558 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:17,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:17,559 INFO L85 PathProgramCache]: Analyzing trace with hash -267180508, now seen corresponding path program 1 times [2021-12-16 01:06:17,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:17,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147676700] [2021-12-16 01:06:17,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:17,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 01:06:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 01:06:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 01:06:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 01:06:17,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:17,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147676700] [2021-12-16 01:06:17,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147676700] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:17,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791555836] [2021-12-16 01:06:17,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:17,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:17,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:17,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 01:06:17,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 01:06:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 01:06:17,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:06:17,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 01:06:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 01:06:18,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791555836] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 01:06:18,051 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 01:06:18,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2021-12-16 01:06:18,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337129570] [2021-12-16 01:06:18,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 01:06:18,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 01:06:18,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:18,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 01:06:18,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-16 01:06:18,053 INFO L87 Difference]: Start difference. First operand 697 states and 900 transitions. Second operand has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-16 01:06:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:18,713 INFO L93 Difference]: Finished difference Result 2397 states and 3120 transitions. [2021-12-16 01:06:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-16 01:06:18,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 68 [2021-12-16 01:06:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:18,719 INFO L225 Difference]: With dead ends: 2397 [2021-12-16 01:06:18,720 INFO L226 Difference]: Without dead ends: 1853 [2021-12-16 01:06:18,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2021-12-16 01:06:18,722 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 429 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:18,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 1721 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:06:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2021-12-16 01:06:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1086. [2021-12-16 01:06:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 967 states have (on average 1.2585315408479834) internal successors, (1217), 983 states have internal predecessors, (1217), 65 states have call successors, (65), 43 states have call predecessors, (65), 53 states have return successors, (106), 59 states have call predecessors, (106), 64 states have call successors, (106) [2021-12-16 01:06:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1388 transitions. [2021-12-16 01:06:18,763 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1388 transitions. Word has length 68 [2021-12-16 01:06:18,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:18,763 INFO L470 AbstractCegarLoop]: Abstraction has 1086 states and 1388 transitions. [2021-12-16 01:06:18,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-16 01:06:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1388 transitions. [2021-12-16 01:06:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-16 01:06:18,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:18,766 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:06:18,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-16 01:06:18,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-16 01:06:18,983 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:18,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:18,983 INFO L85 PathProgramCache]: Analyzing trace with hash 235450586, now seen corresponding path program 1 times [2021-12-16 01:06:18,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:18,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707245154] [2021-12-16 01:06:18,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:18,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 01:06:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 01:06:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 01:06:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 01:06:19,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:19,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707245154] [2021-12-16 01:06:19,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707245154] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:19,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744666884] [2021-12-16 01:06:19,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:19,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:19,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:19,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 01:06:19,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-16 01:06:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 01:06:19,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 01:06:19,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:06:19,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744666884] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:19,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:06:19,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-16 01:06:19,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71459455] [2021-12-16 01:06:19,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:19,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:06:19,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:19,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:06:19,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:06:19,247 INFO L87 Difference]: Start difference. First operand 1086 states and 1388 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-16 01:06:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:19,282 INFO L93 Difference]: Finished difference Result 1809 states and 2326 transitions. [2021-12-16 01:06:19,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:06:19,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 87 [2021-12-16 01:06:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:19,286 INFO L225 Difference]: With dead ends: 1809 [2021-12-16 01:06:19,286 INFO L226 Difference]: Without dead ends: 964 [2021-12-16 01:06:19,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:06:19,288 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 53 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:19,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 199 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:06:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2021-12-16 01:06:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 949. [2021-12-16 01:06:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 846 states have (on average 1.25177304964539) internal successors, (1059), 861 states have internal predecessors, (1059), 57 states have call successors, (57), 37 states have call predecessors, (57), 45 states have return successors, (92), 50 states have call predecessors, (92), 56 states have call successors, (92) [2021-12-16 01:06:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1208 transitions. [2021-12-16 01:06:19,320 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1208 transitions. Word has length 87 [2021-12-16 01:06:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:19,321 INFO L470 AbstractCegarLoop]: Abstraction has 949 states and 1208 transitions. [2021-12-16 01:06:19,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-16 01:06:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1208 transitions. [2021-12-16 01:06:19,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-16 01:06:19,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:19,323 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:06:19,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-16 01:06:19,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:19,540 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:19,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1832296466, now seen corresponding path program 1 times [2021-12-16 01:06:19,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:19,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387651605] [2021-12-16 01:06:19,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:19,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 01:06:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 01:06:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 01:06:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-16 01:06:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-16 01:06:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-16 01:06:19,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:19,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387651605] [2021-12-16 01:06:19,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387651605] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:19,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062922737] [2021-12-16 01:06:19,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:19,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:19,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:19,613 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 01:06:19,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-16 01:06:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 01:06:19,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-16 01:06:19,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:06:19,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062922737] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:19,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:06:19,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-16 01:06:19,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634461639] [2021-12-16 01:06:19,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:19,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:06:19,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:19,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:06:19,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:06:19,838 INFO L87 Difference]: Start difference. First operand 949 states and 1208 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-16 01:06:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:19,861 INFO L93 Difference]: Finished difference Result 1328 states and 1676 transitions. [2021-12-16 01:06:19,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:06:19,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 102 [2021-12-16 01:06:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:19,862 INFO L225 Difference]: With dead ends: 1328 [2021-12-16 01:06:19,862 INFO L226 Difference]: Without dead ends: 0 [2021-12-16 01:06:19,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:06:19,864 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 62 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:19,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 206 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:06:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-16 01:06:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-16 01:06:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:06:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-16 01:06:19,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2021-12-16 01:06:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:19,866 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 01:06:19,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-16 01:06:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-16 01:06:19,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-16 01:06:19,868 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 01:06:19,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-16 01:06:20,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:20,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-16 01:06:22,689 INFO L858 garLoopResultBuilder]: For program point L62(lines 62 67) no Hoare annotation was computed. [2021-12-16 01:06:22,689 INFO L854 garLoopResultBuilder]: At program point immediate_notify_threadsENTRY(lines 76 100) the Hoare annotation is: (let ((.cse3 (= ~p_dw_st~0 |old(~p_dw_st~0)|))) (let ((.cse1 (not (= ~q_free~0 0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (and .cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or .cse0 (not (= ~c_num_read~0 0)) .cse1 .cse2 (not (= ~p_num_write~0 1)) (not (= ~p_dw_pc~0 0)) (not (= ~c_dr_pc~0 0))) (or .cse0 (and .cse3 (= 2 ~c_dr_st~0)) (not (= 2 |old(~c_dr_st~0)|)) .cse1 (not (= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or .cse0 (not (= ~p_num_write~0 ~c_num_read~0)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~q_free~0 1)) .cse2 (not (<= 2 |old(~p_dw_st~0)|)))))) [2021-12-16 01:06:22,689 INFO L854 garLoopResultBuilder]: At program point L54(lines 38 56) the Hoare annotation is: (let ((.cse10 (= ~p_dw_st~0 |old(~p_dw_st~0)|)) (.cse11 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse1 (not (= 2 |old(~c_dr_st~0)|))) (.cse7 (not (= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse9 (and .cse10 .cse11)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= ~q_free~0 0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse3 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse4 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse5 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse6 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6) .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse9 .cse7) (or .cse0 (not (= ~p_num_write~0 ~c_num_read~0)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~q_free~0 1)) .cse9 (not (<= 2 |old(~p_dw_st~0)|))) (or .cse0 (not (= ~c_num_read~0 0)) .cse2 (not (= ~p_num_write~0 1)) .cse8 (not (= ~c_dr_pc~0 0)) (and .cse10 .cse3 .cse4 .cse11 .cse5 .cse6))))) [2021-12-16 01:06:22,689 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 51) no Hoare annotation was computed. [2021-12-16 01:06:22,690 INFO L858 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 76 100) no Hoare annotation was computed. [2021-12-16 01:06:22,690 INFO L854 garLoopResultBuilder]: At program point L73(lines 57 75) the Hoare annotation is: (let ((.cse5 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse6 (<= |immediate_notify_threads_~tmp~0#1| 0)) (.cse7 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse13 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse8 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse9 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse10 (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 2 |old(~c_dr_st~0)|))) (.cse2 (not (= ~q_free~0 0))) (.cse4 (= ~p_dw_st~0 |old(~p_dw_st~0)|)) (.cse12 (= ~p_dw_st~0 0)) (.cse3 (not (= ~p_num_write~0 (+ ~c_num_read~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (or .cse0 (not (= ~p_num_write~0 ~c_num_read~0)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~q_free~0 1)) .cse12 (and .cse4 .cse6 .cse13 .cse10) (not (<= 2 |old(~p_dw_st~0)|))) (or .cse0 (not (= ~c_num_read~0 0)) .cse2 (and .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse10) (not (= ~p_num_write~0 1)) .cse11 (not (= ~c_dr_pc~0 0))) (or .cse0 .cse1 .cse2 (and (or .cse4 .cse12) (= 2 ~c_dr_st~0)) .cse3))) [2021-12-16 01:06:22,690 INFO L858 garLoopResultBuilder]: For program point L42-2(lines 42 51) no Hoare annotation was computed. [2021-12-16 01:06:22,690 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 70) no Hoare annotation was computed. [2021-12-16 01:06:22,690 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2021-12-16 01:06:22,690 INFO L858 garLoopResultBuilder]: For program point L61-2(lines 61 70) no Hoare annotation was computed. [2021-12-16 01:06:22,690 INFO L858 garLoopResultBuilder]: For program point L92-2(lines 76 100) no Hoare annotation was computed. [2021-12-16 01:06:22,690 INFO L854 garLoopResultBuilder]: At program point L53(lines 41 55) the Hoare annotation is: (let ((.cse3 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse5 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (= 2 |old(~c_dr_st~0)|))) (.cse1 (not (= ~q_free~0 0))) (.cse8 (not (= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (= ~p_dw_st~0 |old(~p_dw_st~0)|)) (.cse4 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (and (or .cse0 (not (= ~c_num_read~0 0)) .cse1 (and .cse2 .cse3 .cse4 .cse5) (not (= ~p_num_write~0 1)) .cse6 (not (= ~c_dr_pc~0 0))) (or (and .cse3 .cse5) .cse0 .cse7 .cse1 .cse8 .cse6) (or .cse0 (and .cse2 (= 2 ~c_dr_st~0)) .cse7 .cse1 .cse8) (or .cse0 (not (= ~p_num_write~0 ~c_num_read~0)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~q_free~0 1)) (and .cse2 .cse4) (not (<= 2 |old(~p_dw_st~0)|))))) [2021-12-16 01:06:22,690 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 88) no Hoare annotation was computed. [2021-12-16 01:06:22,690 INFO L858 garLoopResultBuilder]: For program point L84-2(lines 84 88) no Hoare annotation was computed. [2021-12-16 01:06:22,690 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 48) no Hoare annotation was computed. [2021-12-16 01:06:22,690 INFO L854 garLoopResultBuilder]: At program point L72(lines 60 74) the Hoare annotation is: (let ((.cse5 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse6 (<= |immediate_notify_threads_~tmp~0#1| 0)) (.cse7 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse13 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse8 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse9 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse10 (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 2 |old(~c_dr_st~0)|))) (.cse2 (not (= ~q_free~0 0))) (.cse4 (= ~p_dw_st~0 |old(~p_dw_st~0)|)) (.cse12 (= ~p_dw_st~0 0)) (.cse3 (not (= ~p_num_write~0 (+ ~c_num_read~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (or .cse0 (not (= ~p_num_write~0 ~c_num_read~0)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~q_free~0 1)) .cse12 (and .cse4 .cse6 .cse13 .cse10) (not (<= 2 |old(~p_dw_st~0)|))) (or .cse0 (not (= ~c_num_read~0 0)) .cse2 (and .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse10) (not (= ~p_num_write~0 1)) .cse11 (not (= ~c_dr_pc~0 0))) (or .cse0 .cse1 .cse2 (and (or .cse4 .cse12) (= 2 ~c_dr_st~0)) .cse3))) [2021-12-16 01:06:22,690 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 234) no Hoare annotation was computed. [2021-12-16 01:06:22,690 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 220 239) no Hoare annotation was computed. [2021-12-16 01:06:22,691 INFO L861 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 220 239) the Hoare annotation is: true [2021-12-16 01:06:22,691 INFO L861 garLoopResultBuilder]: At program point L236(lines 223 238) the Hoare annotation is: true [2021-12-16 01:06:22,691 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 233) no Hoare annotation was computed. [2021-12-16 01:06:22,691 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 220 239) no Hoare annotation was computed. [2021-12-16 01:06:22,691 INFO L854 garLoopResultBuilder]: At program point L192(line 192) the Hoare annotation is: false [2021-12-16 01:06:22,691 INFO L854 garLoopResultBuilder]: At program point L192-1(lines 148 200) the Hoare annotation is: (let ((.cse0 (= ~c_last_read~0 ~p_last_write~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse4 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_dw_st~0 0)) (and (= ~q_free~0 0) (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse1 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4))) [2021-12-16 01:06:22,691 INFO L858 garLoopResultBuilder]: For program point L250(line 250) no Hoare annotation was computed. [2021-12-16 01:06:22,691 INFO L858 garLoopResultBuilder]: For program point L118(lines 117 137) no Hoare annotation was computed. [2021-12-16 01:06:22,691 INFO L854 garLoopResultBuilder]: At program point L300(line 300) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse9 (= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse5 (= ~p_dw_st~0 0)) (.cse11 (= ~q_free~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= 2 ~c_dr_st~0)) (.cse8 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse7) (and .cse2 .cse9 .cse3 .cse8 .cse10) (and .cse2 .cse9 .cse3 .cse5 .cse10) (and .cse11 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse8) (and .cse11 .cse2 .cse10 .cse8))) [2021-12-16 01:06:22,691 INFO L858 garLoopResultBuilder]: For program point L300-1(line 300) no Hoare annotation was computed. [2021-12-16 01:06:22,691 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-16 01:06:22,691 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-16 01:06:22,691 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 156) no Hoare annotation was computed. [2021-12-16 01:06:22,691 INFO L854 garLoopResultBuilder]: At program point L119(lines 105 142) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_dr_pc~0 0) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0)) (and .cse0 (= ~p_num_write~0 ~c_num_read~0) (= 2 ~c_dr_st~0)))) [2021-12-16 01:06:22,691 INFO L854 garLoopResultBuilder]: At program point L309(lines 298 311) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse9 (= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse5 (= ~p_dw_st~0 0)) (.cse11 (= ~q_free~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= 2 ~c_dr_st~0)) (.cse8 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse7) (and .cse2 .cse9 .cse3 .cse8 .cse10) (and .cse2 .cse9 .cse3 .cse5 .cse10) (and .cse11 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse8) (and .cse11 .cse2 .cse10 .cse8))) [2021-12-16 01:06:22,691 INFO L858 garLoopResultBuilder]: For program point L276(lines 276 283) no Hoare annotation was computed. [2021-12-16 01:06:22,692 INFO L858 garLoopResultBuilder]: For program point L161(lines 160 195) no Hoare annotation was computed. [2021-12-16 01:06:22,692 INFO L858 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2021-12-16 01:06:22,692 INFO L858 garLoopResultBuilder]: For program point L252-1(lines 247 287) no Hoare annotation was computed. [2021-12-16 01:06:22,692 INFO L854 garLoopResultBuilder]: At program point L153(lines 148 200) the Hoare annotation is: (and (= ~q_free~0 0) (= ~p_num_write~0 (+ ~c_num_read~0 1)) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~p_dw_st~0)) [2021-12-16 01:06:22,692 INFO L854 garLoopResultBuilder]: At program point L310(lines 294 312) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse9 (= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse5 (= ~p_dw_st~0 0)) (.cse11 (= ~q_free~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= 2 ~c_dr_st~0)) (.cse8 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse7) (and .cse2 .cse9 .cse3 .cse8 .cse10) (and .cse2 .cse9 .cse3 .cse5 .cse10) (and .cse11 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse8) (and .cse11 .cse2 .cse10 .cse8))) [2021-12-16 01:06:22,692 INFO L854 garLoopResultBuilder]: At program point L211-1(lines 202 219) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 1)) (.cse4 (= ~c_dr_pc~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_dw_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~p_dw_st~0) .cse6))) [2021-12-16 01:06:22,692 INFO L861 garLoopResultBuilder]: At program point L368(lines 359 370) the Hoare annotation is: true [2021-12-16 01:06:22,692 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 307) no Hoare annotation was computed. [2021-12-16 01:06:22,692 INFO L858 garLoopResultBuilder]: For program point L261(lines 261 268) no Hoare annotation was computed. [2021-12-16 01:06:22,692 INFO L858 garLoopResultBuilder]: For program point L162-1(lines 162 172) no Hoare annotation was computed. [2021-12-16 01:06:22,692 INFO L854 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: false [2021-12-16 01:06:22,692 INFO L854 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: (and (= ~c_last_read~0 ~p_last_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~p_num_write~0 ~c_num_read~0) (= ~q_free~0 1) (<= 2 ~p_dw_st~0)) [2021-12-16 01:06:22,692 INFO L858 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2021-12-16 01:06:22,692 INFO L861 garLoopResultBuilder]: At program point L336(lines 313 341) the Hoare annotation is: true [2021-12-16 01:06:22,692 INFO L854 garLoopResultBuilder]: At program point L138(lines 101 143) the Hoare annotation is: (let ((.cse0 (= ~q_free~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse1 .cse2) (and .cse0 .cse1 (= 2 ~c_dr_st~0) .cse2))) [2021-12-16 01:06:22,692 INFO L854 garLoopResultBuilder]: At program point L196(lines 145 201) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~q_free~0 1)) (.cse3 (= 2 ~c_dr_st~0))) (or (and .cse0 .cse1 .cse2 (<= 2 ~p_dw_st~0) .cse3) (and .cse0 .cse1 .cse2 (= ~p_dw_st~0 0) .cse3))) [2021-12-16 01:06:22,692 INFO L858 garLoopResultBuilder]: For program point L106(lines 106 114) no Hoare annotation was computed. [2021-12-16 01:06:22,693 INFO L854 garLoopResultBuilder]: At program point L288(lines 240 293) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse9 (= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse5 (= ~p_dw_st~0 0)) (.cse11 (= ~q_free~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= 2 ~c_dr_st~0)) (.cse8 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse7) (and .cse2 .cse9 .cse3 .cse8 .cse10) (and .cse2 .cse9 .cse3 .cse5 .cse10) (and .cse11 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse8) (and .cse11 .cse2 .cse10 .cse8))) [2021-12-16 01:06:22,693 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-16 01:06:22,693 INFO L854 garLoopResultBuilder]: At program point L272(lines 247 287) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse9 (= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse5 (= ~p_dw_st~0 0)) (.cse11 (= ~q_free~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= 2 ~c_dr_st~0)) (.cse8 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse7) (and .cse2 .cse9 .cse3 .cse8 .cse10) (and .cse2 .cse9 .cse3 .cse5 .cse10) (and .cse11 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse8) (and .cse11 .cse2 .cse10 .cse8))) [2021-12-16 01:06:22,693 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 210) no Hoare annotation was computed. [2021-12-16 01:06:22,693 INFO L858 garLoopResultBuilder]: For program point L206-2(lines 205 218) no Hoare annotation was computed. [2021-12-16 01:06:22,693 INFO L858 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2021-12-16 01:06:22,693 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-16 01:06:22,693 INFO L854 garLoopResultBuilder]: At program point L248(line 248) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse9 (= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse5 (= ~p_dw_st~0 0)) (.cse11 (= ~q_free~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= 2 ~c_dr_st~0)) (.cse8 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse7) (and .cse2 .cse9 .cse3 .cse8 .cse10) (and .cse2 .cse9 .cse3 .cse5 .cse10) (and .cse11 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse8) (and .cse11 .cse2 .cse10 .cse8))) [2021-12-16 01:06:22,693 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 194) no Hoare annotation was computed. [2021-12-16 01:06:22,693 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2021-12-16 01:06:22,693 INFO L854 garLoopResultBuilder]: At program point L356(lines 342 358) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= ~c_dr_pc~0 0) (= ~p_dw_st~0 0) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0)) [2021-12-16 01:06:22,693 INFO L858 garLoopResultBuilder]: For program point L257(lines 247 287) no Hoare annotation was computed. [2021-12-16 01:06:22,693 INFO L854 garLoopResultBuilder]: At program point L323-2(lines 323 335) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse9 (= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse5 (= ~p_dw_st~0 0)) (.cse11 (= ~q_free~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= 2 ~c_dr_st~0)) (.cse8 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse7) (and .cse2 .cse9 .cse3 .cse8 .cse10) (and .cse2 .cse9 .cse3 .cse5 .cse10) (and .cse11 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse8) (and .cse11 .cse2 .cse10 .cse8))) [2021-12-16 01:06:22,693 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 189) no Hoare annotation was computed. [2021-12-16 01:06:22,693 INFO L854 garLoopResultBuilder]: At program point L117-1(lines 105 142) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 1)) (.cse3 (= 2 ~c_dr_st~0))) (or (and (= ~p_num_write~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse0 .cse1 (= ~c_dr_pc~0 0) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0)) (and .cse2 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse0) (and .cse2 .cse0 .cse3) (and .cse0 (= ~p_num_write~0 ~c_num_read~0) .cse1 .cse3))) [2021-12-16 01:06:22,694 INFO L858 garLoopResultBuilder]: For program point L109(lines 109 113) no Hoare annotation was computed. [2021-12-16 01:06:22,694 INFO L854 garLoopResultBuilder]: At program point L134(line 134) the Hoare annotation is: (let ((.cse0 (= ~q_free~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse1 (= 2 ~c_dr_st~0)) (and (= ~p_num_write~0 1) .cse0 .cse1 (= ~c_dr_pc~0 0) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0)))) [2021-12-16 01:06:22,694 INFO L858 garLoopResultBuilder]: For program point L134-1(line 134) no Hoare annotation was computed. [2021-12-16 01:06:22,694 INFO L858 garLoopResultBuilder]: For program point L324(line 324) no Hoare annotation was computed. [2021-12-16 01:06:22,694 INFO L858 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2021-12-16 01:06:22,694 INFO L858 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-12-16 01:06:22,694 INFO L861 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2021-12-16 01:06:22,694 INFO L858 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2021-12-16 01:06:22,700 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:06:22,701 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 01:06:22,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:06:22 BoogieIcfgContainer [2021-12-16 01:06:22,753 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 01:06:22,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 01:06:22,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 01:06:22,753 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 01:06:22,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:06:15" (3/4) ... [2021-12-16 01:06:22,756 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-16 01:06:22,760 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2021-12-16 01:06:22,761 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2021-12-16 01:06:22,761 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2021-12-16 01:06:22,775 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2021-12-16 01:06:22,776 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-16 01:06:22,776 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-16 01:06:22,776 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-16 01:06:22,792 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(p_last_write == q_buf_0) || !(c_num_read == 0)) || !(q_free == 0)) || (((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= __retres1)) || !(p_num_write == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) && ((((((__retres1 <= 0 && 0 <= __retres1) || !(p_last_write == q_buf_0)) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || !(p_num_write == c_num_read + 1)) || !(p_dw_pc == 0))) && ((((!(p_last_write == q_buf_0) || (p_dw_st == \old(p_dw_st) && 2 == c_dr_st)) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || !(p_num_write == c_num_read + 1))) && (((((!(p_last_write == q_buf_0) || !(p_num_write == c_num_read)) || !(c_last_read == p_last_write)) || !(q_free == 1)) || (p_dw_st == \old(p_dw_st) && c_dr_st == \old(c_dr_st))) || !(2 <= \old(p_dw_st))) [2021-12-16 01:06:22,792 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(p_last_write == q_buf_0) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || (((__retres1 <= 0 && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(p_num_write == c_num_read + 1)) || !(p_dw_pc == 0)) && ((((!(p_last_write == q_buf_0) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || (p_dw_st == \old(p_dw_st) && c_dr_st == \old(c_dr_st))) || !(p_num_write == c_num_read + 1))) && (((((!(p_last_write == q_buf_0) || !(p_num_write == c_num_read)) || !(c_last_read == p_last_write)) || !(q_free == 1)) || (p_dw_st == \old(p_dw_st) && c_dr_st == \old(c_dr_st))) || !(2 <= \old(p_dw_st)))) && ((((((!(p_last_write == q_buf_0) || !(c_num_read == 0)) || !(q_free == 0)) || !(p_num_write == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || (((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && \result <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= \result) && 0 <= __retres1)) [2021-12-16 01:06:22,792 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(p_last_write == q_buf_0) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || !(p_num_write == c_num_read + 1)) || ((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(p_dw_pc == 0)) && ((((((!(p_last_write == q_buf_0) || !(p_num_write == c_num_read)) || !(c_last_read == p_last_write)) || !(q_free == 1)) || p_dw_st == 0) || (((p_dw_st == \old(p_dw_st) && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(2 <= \old(p_dw_st)))) && ((((((!(p_last_write == q_buf_0) || !(c_num_read == 0)) || !(q_free == 0)) || (((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(p_num_write == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0))) && ((((!(p_last_write == q_buf_0) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || ((p_dw_st == \old(p_dw_st) || p_dw_st == 0) && 2 == c_dr_st)) || !(p_num_write == c_num_read + 1)) [2021-12-16 01:06:22,793 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(p_last_write == q_buf_0) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || !(p_num_write == c_num_read + 1)) || ((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(p_dw_pc == 0)) && ((((((!(p_last_write == q_buf_0) || !(p_num_write == c_num_read)) || !(c_last_read == p_last_write)) || !(q_free == 1)) || p_dw_st == 0) || (((p_dw_st == \old(p_dw_st) && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(2 <= \old(p_dw_st)))) && ((((((!(p_last_write == q_buf_0) || !(c_num_read == 0)) || !(q_free == 0)) || (((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(p_num_write == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0))) && ((((!(p_last_write == q_buf_0) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || ((p_dw_st == \old(p_dw_st) || p_dw_st == 0) && 2 == c_dr_st)) || !(p_num_write == c_num_read + 1)) [2021-12-16 01:06:22,814 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 01:06:22,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 01:06:22,815 INFO L158 Benchmark]: Toolchain (without parser) took 8468.17ms. Allocated memory was 109.1MB in the beginning and 174.1MB in the end (delta: 65.0MB). Free memory was 77.6MB in the beginning and 93.5MB in the end (delta: -15.9MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2021-12-16 01:06:22,815 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 01:06:22,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.98ms. Allocated memory is still 109.1MB. Free memory was 77.4MB in the beginning and 84.8MB in the end (delta: -7.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 01:06:22,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.05ms. Allocated memory is still 109.1MB. Free memory was 84.8MB in the beginning and 82.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:06:22,816 INFO L158 Benchmark]: Boogie Preprocessor took 46.51ms. Allocated memory is still 109.1MB. Free memory was 82.9MB in the beginning and 81.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:06:22,816 INFO L158 Benchmark]: RCFGBuilder took 357.46ms. Allocated memory is still 109.1MB. Free memory was 81.3MB in the beginning and 68.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-16 01:06:22,817 INFO L158 Benchmark]: TraceAbstraction took 7546.21ms. Allocated memory was 109.1MB in the beginning and 174.1MB in the end (delta: 65.0MB). Free memory was 67.7MB in the beginning and 99.8MB in the end (delta: -32.2MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. [2021-12-16 01:06:22,817 INFO L158 Benchmark]: Witness Printer took 61.62ms. Allocated memory is still 174.1MB. Free memory was 99.8MB in the beginning and 93.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-16 01:06:22,818 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 90.2MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.98ms. Allocated memory is still 109.1MB. Free memory was 77.4MB in the beginning and 84.8MB in the end (delta: -7.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.05ms. Allocated memory is still 109.1MB. Free memory was 84.8MB in the beginning and 82.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.51ms. Allocated memory is still 109.1MB. Free memory was 82.9MB in the beginning and 81.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 357.46ms. Allocated memory is still 109.1MB. Free memory was 81.3MB in the beginning and 68.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7546.21ms. Allocated memory was 109.1MB in the beginning and 174.1MB in the end (delta: 65.0MB). Free memory was 67.7MB in the beginning and 99.8MB in the end (delta: -32.2MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. * Witness Printer took 61.62ms. Allocated memory is still 174.1MB. Free memory was 99.8MB in the beginning and 93.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1239 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1226 mSDsluCounter, 3700 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2435 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 715 IncrementalHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 1265 mSDtfsCounter, 715 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 605 GetRequests, 530 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1086occurred in iteration=7, InterpolantAutomatonStates: 76, 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, 9 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 722 PreInvPairs, 898 NumberOfFragments, 1804 HoareAnnotationTreeSize, 722 FomulaSimplifications, 1024 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 29 FomulaSimplificationsInter, 10472 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1026 ConstructedInterpolants, 0 QuantifiedInterpolants, 1960 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1142 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 270/342 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((p_num_write == 0 && p_last_write == q_buf_0) && c_dr_pc == 0) && c_num_read == 0) && p_dw_pc == 0) || ((p_last_write == q_buf_0 && p_num_write == c_num_read) && 2 == c_dr_st) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((((((!(p_last_write == q_buf_0) || !(c_num_read == 0)) || !(q_free == 0)) || (((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= __retres1)) || !(p_num_write == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) && ((((((__retres1 <= 0 && 0 <= __retres1) || !(p_last_write == q_buf_0)) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || !(p_num_write == c_num_read + 1)) || !(p_dw_pc == 0))) && ((((!(p_last_write == q_buf_0) || (p_dw_st == \old(p_dw_st) && 2 == c_dr_st)) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || !(p_num_write == c_num_read + 1))) && (((((!(p_last_write == q_buf_0) || !(p_num_write == c_num_read)) || !(c_last_read == p_last_write)) || !(q_free == 1)) || (p_dw_st == \old(p_dw_st) && c_dr_st == \old(c_dr_st))) || !(2 <= \old(p_dw_st))) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((p_num_write == 0 && c_last_read == p_last_write) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && p_dw_st == 0) && c_num_read == 0) && p_dw_pc == 0 - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_last_read == p_last_write) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && p_dw_st == 0) && c_num_read == 0) && p_dw_pc == 0) || (((((((p_num_write == 0 && c_last_read == p_last_write) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && c_num_read == 0) && 2 <= p_dw_st) && p_dw_pc == 0)) || ((((p_last_write == q_buf_0 && p_num_write == c_num_read) && q_free == 1) && 2 <= p_dw_st) && 2 == c_dr_st)) || ((((p_last_write == q_buf_0 && p_num_write == c_num_read) && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st)) || (((q_free == 0 && p_num_write == c_num_read + 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((q_free == 0 && p_last_write == q_buf_0) && 2 == c_dr_st) && 2 <= p_dw_st) - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((p_num_write == 0 && c_last_read == p_last_write) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && p_dw_st == 0) && c_num_read == 0) && p_dw_pc == 0) || (((((((p_num_write == 0 && c_last_read == p_last_write) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && c_num_read == 0) && 2 <= p_dw_st) && p_dw_pc == 0) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((q_free == 0 && p_num_write == c_num_read + 1) && p_last_write == q_buf_0) && 2 <= p_dw_st - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_last_read == p_last_write) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && p_dw_st == 0) && c_num_read == 0) && p_dw_pc == 0) || (((((((p_num_write == 0 && c_last_read == p_last_write) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && c_num_read == 0) && 2 <= p_dw_st) && p_dw_pc == 0)) || ((((p_last_write == q_buf_0 && p_num_write == c_num_read) && q_free == 1) && 2 <= p_dw_st) && 2 == c_dr_st)) || ((((p_last_write == q_buf_0 && p_num_write == c_num_read) && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st)) || (((q_free == 0 && p_num_write == c_num_read + 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((q_free == 0 && p_last_write == q_buf_0) && 2 == c_dr_st) && 2 <= p_dw_st) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (((((((!(p_last_write == q_buf_0) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || !(p_num_write == c_num_read + 1)) || ((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(p_dw_pc == 0)) && ((((((!(p_last_write == q_buf_0) || !(p_num_write == c_num_read)) || !(c_last_read == p_last_write)) || !(q_free == 1)) || p_dw_st == 0) || (((p_dw_st == \old(p_dw_st) && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(2 <= \old(p_dw_st)))) && ((((((!(p_last_write == q_buf_0) || !(c_num_read == 0)) || !(q_free == 0)) || (((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(p_num_write == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0))) && ((((!(p_last_write == q_buf_0) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || ((p_dw_st == \old(p_dw_st) || p_dw_st == 0) && 2 == c_dr_st)) || !(p_num_write == c_num_read + 1)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((!(p_last_write == q_buf_0) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || (((__retres1 <= 0 && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(p_num_write == c_num_read + 1)) || !(p_dw_pc == 0)) && ((((!(p_last_write == q_buf_0) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || (p_dw_st == \old(p_dw_st) && c_dr_st == \old(c_dr_st))) || !(p_num_write == c_num_read + 1))) && (((((!(p_last_write == q_buf_0) || !(p_num_write == c_num_read)) || !(c_last_read == p_last_write)) || !(q_free == 1)) || (p_dw_st == \old(p_dw_st) && c_dr_st == \old(c_dr_st))) || !(2 <= \old(p_dw_st)))) && ((((((!(p_last_write == q_buf_0) || !(c_num_read == 0)) || !(q_free == 0)) || !(p_num_write == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || (((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && \result <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= \result) && 0 <= __retres1)) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_last_read == p_last_write) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && p_dw_st == 0) && c_num_read == 0) && p_dw_pc == 0) || (((((((p_num_write == 0 && c_last_read == p_last_write) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && c_num_read == 0) && 2 <= p_dw_st) && p_dw_pc == 0)) || ((((p_last_write == q_buf_0 && p_num_write == c_num_read) && q_free == 1) && 2 <= p_dw_st) && 2 == c_dr_st)) || ((((p_last_write == q_buf_0 && p_num_write == c_num_read) && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st)) || (((q_free == 0 && p_num_write == c_num_read + 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((q_free == 0 && p_last_write == q_buf_0) && 2 == c_dr_st) && 2 <= p_dw_st) - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_last_read == p_last_write) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && p_dw_st == 0) && c_num_read == 0) && p_dw_pc == 0) || (((((((p_num_write == 0 && c_last_read == p_last_write) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && c_num_read == 0) && 2 <= p_dw_st) && p_dw_pc == 0)) || ((((p_last_write == q_buf_0 && p_num_write == c_num_read) && q_free == 1) && 2 <= p_dw_st) && 2 == c_dr_st)) || ((((p_last_write == q_buf_0 && p_num_write == c_num_read) && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st)) || (((q_free == 0 && p_num_write == c_num_read + 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((q_free == 0 && p_last_write == q_buf_0) && 2 == c_dr_st) && 2 <= p_dw_st) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((!(p_last_write == q_buf_0) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || !(p_num_write == c_num_read + 1)) || ((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(p_dw_pc == 0)) && ((((((!(p_last_write == q_buf_0) || !(p_num_write == c_num_read)) || !(c_last_read == p_last_write)) || !(q_free == 1)) || p_dw_st == 0) || (((p_dw_st == \old(p_dw_st) && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(2 <= \old(p_dw_st)))) && ((((((!(p_last_write == q_buf_0) || !(c_num_read == 0)) || !(q_free == 0)) || (((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(p_num_write == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0))) && ((((!(p_last_write == q_buf_0) || !(2 == \old(c_dr_st))) || !(q_free == 0)) || ((p_dw_st == \old(p_dw_st) || p_dw_st == 0) && 2 == c_dr_st)) || !(p_num_write == c_num_read + 1)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((p_num_write == 0 && c_last_read == p_last_write) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && c_num_read == 0) && p_dw_pc == 0) || ((q_free == 0 && p_num_write == c_num_read + 1) && p_last_write == q_buf_0)) || ((q_free == 0 && p_last_write == q_buf_0) && 2 == c_dr_st)) || (((p_last_write == q_buf_0 && p_num_write == c_num_read) && q_free == 1) && 2 == c_dr_st) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((((c_last_read == p_last_write && p_last_write == q_buf_0) && p_num_write == c_num_read) && q_free == 1) && p_dw_st == 0) || (((q_free == 0 && p_num_write == c_num_read + 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((c_last_read == p_last_write && p_last_write == q_buf_0) && p_num_write == c_num_read) && q_free == 1) && 2 <= p_dw_st) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((q_free == 0 && p_num_write == c_num_read + 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) || (((q_free == 0 && p_last_write == q_buf_0) && 2 == c_dr_st) && 2 <= p_dw_st) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((p_last_write == q_buf_0 && p_num_write == c_num_read) && q_free == 1) && 2 <= p_dw_st) && 2 == c_dr_st) || ((((p_last_write == q_buf_0 && p_num_write == c_num_read) && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_last_read == p_last_write) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && p_dw_st == 0) && c_num_read == 0) && p_dw_pc == 0) || (((((((p_num_write == 0 && c_last_read == p_last_write) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && c_num_read == 0) && 2 <= p_dw_st) && p_dw_pc == 0)) || ((((p_last_write == q_buf_0 && p_num_write == c_num_read) && q_free == 1) && 2 <= p_dw_st) && 2 == c_dr_st)) || ((((p_last_write == q_buf_0 && p_num_write == c_num_read) && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st)) || (((q_free == 0 && p_num_write == c_num_read + 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((q_free == 0 && p_last_write == q_buf_0) && 2 == c_dr_st) && 2 <= p_dw_st) RESULT: Ultimate proved your program to be correct! [2021-12-16 01:06:22,860 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 Result: TRUE