./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix044_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 997cd7c3 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/pthread-wmm/mix044_tso.opt.i -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 0161667e3a3d345d3928b93aa3b1536eecdc6697 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-997cd7c-m [2021-09-22 14:43:47,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-22 14:43:47,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-22 14:43:47,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-22 14:43:47,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-22 14:43:47,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-22 14:43:47,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-22 14:43:47,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-22 14:43:47,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-22 14:43:47,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-22 14:43:47,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-22 14:43:47,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-22 14:43:47,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-22 14:43:47,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-22 14:43:47,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-22 14:43:47,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-22 14:43:47,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-22 14:43:47,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-22 14:43:47,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-22 14:43:47,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-22 14:43:47,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-22 14:43:47,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-22 14:43:47,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-22 14:43:47,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-22 14:43:47,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-22 14:43:47,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-22 14:43:47,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-22 14:43:47,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-22 14:43:47,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-22 14:43:47,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-22 14:43:47,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-22 14:43:47,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-22 14:43:47,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-22 14:43:47,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-22 14:43:47,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-22 14:43:47,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-22 14:43:47,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-22 14:43:47,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-22 14:43:47,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-22 14:43:47,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-22 14:43:47,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-22 14:43:47,569 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-22 14:43:47,583 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-22 14:43:47,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-22 14:43:47,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-22 14:43:47,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-22 14:43:47,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-22 14:43:47,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-22 14:43:47,585 INFO L138 SettingsManager]: * Use SBE=true [2021-09-22 14:43:47,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-22 14:43:47,585 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-22 14:43:47,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-22 14:43:47,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-22 14:43:47,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-22 14:43:47,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-22 14:43:47,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-22 14:43:47,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-22 14:43:47,586 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-22 14:43:47,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-22 14:43:47,587 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-22 14:43:47,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-22 14:43:47,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-22 14:43:47,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-22 14:43:47,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-22 14:43:47,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:43:47,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-22 14:43:47,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-22 14:43:47,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-22 14:43:47,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-22 14:43:47,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-22 14:43:47,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-22 14:43:47,593 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-22 14:43:47,593 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 -> 0161667e3a3d345d3928b93aa3b1536eecdc6697 [2021-09-22 14:43:47,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-22 14:43:47,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-22 14:43:47,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-22 14:43:47,873 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-22 14:43:47,874 INFO L275 PluginConnector]: CDTParser initialized [2021-09-22 14:43:47,875 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix044_tso.opt.i [2021-09-22 14:43:47,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b42a6ecf/bbd5680c78b14a85933b8c9f5f730912/FLAGf2062d1f4 [2021-09-22 14:43:48,344 INFO L306 CDTParser]: Found 1 translation units. [2021-09-22 14:43:48,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix044_tso.opt.i [2021-09-22 14:43:48,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b42a6ecf/bbd5680c78b14a85933b8c9f5f730912/FLAGf2062d1f4 [2021-09-22 14:43:48,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b42a6ecf/bbd5680c78b14a85933b8c9f5f730912 [2021-09-22 14:43:48,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-22 14:43:48,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-22 14:43:48,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-22 14:43:48,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-22 14:43:48,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-22 14:43:48,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:43:48" (1/1) ... [2021-09-22 14:43:48,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8bbad48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:43:48, skipping insertion in model container [2021-09-22 14:43:48,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:43:48" (1/1) ... [2021-09-22 14:43:48,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-22 14:43:48,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-22 14:43:48,595 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix044_tso.opt.i[948,961] [2021-09-22 14:43:48,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:43:48,772 INFO L203 MainTranslator]: Completed pre-run [2021-09-22 14:43:48,779 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix044_tso.opt.i[948,961] [2021-09-22 14:43:48,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:43:48,861 INFO L208 MainTranslator]: Completed translation [2021-09-22 14:43:48,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:43:48 WrapperNode [2021-09-22 14:43:48,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-22 14:43:48,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-22 14:43:48,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-22 14:43:48,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-22 14:43:48,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:43:48" (1/1) ... [2021-09-22 14:43:48,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:43:48" (1/1) ... [2021-09-22 14:43:48,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-22 14:43:48,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-22 14:43:48,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-22 14:43:48,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-22 14:43:48,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:43:48" (1/1) ... [2021-09-22 14:43:48,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:43:48" (1/1) ... [2021-09-22 14:43:48,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:43:48" (1/1) ... [2021-09-22 14:43:48,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:43:48" (1/1) ... [2021-09-22 14:43:48,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:43:48" (1/1) ... [2021-09-22 14:43:48,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:43:48" (1/1) ... [2021-09-22 14:43:48,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:43:48" (1/1) ... [2021-09-22 14:43:48,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-22 14:43:48,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-22 14:43:48,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-22 14:43:48,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-22 14:43:48,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:43:48" (1/1) ... [2021-09-22 14:43:48,990 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:43:48,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-22 14:43:49,019 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-09-22 14:43:49,043 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-09-22 14:43:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-09-22 14:43:49,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-09-22 14:43:49,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-22 14:43:49,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-09-22 14:43:49,056 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-09-22 14:43:49,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-09-22 14:43:49,056 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-09-22 14:43:49,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-09-22 14:43:49,057 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-09-22 14:43:49,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-09-22 14:43:49,057 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-09-22 14:43:49,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-09-22 14:43:49,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-22 14:43:49,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-09-22 14:43:49,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-22 14:43:49,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-22 14:43:49,062 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-09-22 14:43:50,311 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-22 14:43:50,311 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-09-22 14:43:50,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:43:50 BoogieIcfgContainer [2021-09-22 14:43:50,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-22 14:43:50,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-22 14:43:50,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-22 14:43:50,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-22 14:43:50,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 02:43:48" (1/3) ... [2021-09-22 14:43:50,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d983cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:43:50, skipping insertion in model container [2021-09-22 14:43:50,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:43:48" (2/3) ... [2021-09-22 14:43:50,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d983cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:43:50, skipping insertion in model container [2021-09-22 14:43:50,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:43:50" (3/3) ... [2021-09-22 14:43:50,320 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_tso.opt.i [2021-09-22 14:43:50,326 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-09-22 14:43:50,326 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-22 14:43:50,326 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-09-22 14:43:50,326 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-09-22 14:43:50,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,365 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,365 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,365 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,367 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,367 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,371 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,372 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,372 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,372 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,372 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,372 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,373 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,373 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,391 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,392 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,394 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,394 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,395 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,395 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,397 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,398 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,398 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:43:50,399 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-09-22 14:43:50,424 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-22 14:43:50,428 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, mConcurrency=FINITE_AUTOMATA, 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-09-22 14:43:50,428 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-09-22 14:43:50,436 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-09-22 14:43:50,442 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 278 flow [2021-09-22 14:43:50,443 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 278 flow [2021-09-22 14:43:50,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2021-09-22 14:43:50,472 INFO L129 PetriNetUnfolder]: 2/125 cut-off events. [2021-09-22 14:43:50,473 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-09-22 14:43:50,475 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2021-09-22 14:43:50,477 INFO L116 LiptonReduction]: Number of co-enabled transitions 2878 [2021-09-22 14:43:57,124 INFO L131 LiptonReduction]: Checked pairs total: 6593 [2021-09-22 14:43:57,129 INFO L133 LiptonReduction]: Total number of compositions: 107 [2021-09-22 14:43:57,134 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2021-09-22 14:43:57,250 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 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-09-22 14:43:57,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 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-09-22 14:43:57,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-09-22 14:43:57,266 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:43:57,266 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:43:57,266 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:43:57,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:43:57,270 INFO L82 PathProgramCache]: Analyzing trace with hash 667551178, now seen corresponding path program 1 times [2021-09-22 14:43:57,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:43:57,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402007972] [2021-09-22 14:43:57,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:43:57,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:43:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:43:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:43:57,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:43:57,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402007972] [2021-09-22 14:43:57,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402007972] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:43:57,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:43:57,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-09-22 14:43:57,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806253862] [2021-09-22 14:43:57,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:43:57,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:43:57,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:43:57,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:43:57,484 INFO L87 Difference]: Start difference. First operand has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 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) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-09-22 14:43:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:43:57,573 INFO L93 Difference]: Finished difference Result 2682 states and 10328 transitions. [2021-09-22 14:43:57,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:43:57,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2021-09-22 14:43:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:43:57,610 INFO L225 Difference]: With dead ends: 2682 [2021-09-22 14:43:57,610 INFO L226 Difference]: Without dead ends: 2602 [2021-09-22 14:43:57,611 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:43:57,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2021-09-22 14:43:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2021-09-22 14:43:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2601 states have (on average 3.869281045751634) internal successors, (10064), 2601 states have internal predecessors, (10064), 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-09-22 14:43:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2021-09-22 14:43:57,791 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2021-09-22 14:43:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:43:57,791 INFO L470 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2021-09-22 14:43:57,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-09-22 14:43:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2021-09-22 14:43:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-22 14:43:57,799 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:43:57,799 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:43:57,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-22 14:43:57,800 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:43:57,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:43:57,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1320442842, now seen corresponding path program 1 times [2021-09-22 14:43:57,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:43:57,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110140876] [2021-09-22 14:43:57,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:43:57,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:43:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:43:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:43:57,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:43:57,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110140876] [2021-09-22 14:43:57,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110140876] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:43:57,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:43:57,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:43:57,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213618325] [2021-09-22 14:43:57,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:43:57,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:43:57,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:43:57,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:43:57,946 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-09-22 14:43:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:43:57,981 INFO L93 Difference]: Finished difference Result 2762 states and 10352 transitions. [2021-09-22 14:43:57,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:43:57,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2021-09-22 14:43:57,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:43:57,992 INFO L225 Difference]: With dead ends: 2762 [2021-09-22 14:43:57,993 INFO L226 Difference]: Without dead ends: 2282 [2021-09-22 14:43:57,993 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:43:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2021-09-22 14:43:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2021-09-22 14:43:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 2281 states have (on average 3.8088557650153443) internal successors, (8688), 2281 states have internal predecessors, (8688), 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-09-22 14:43:58,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2021-09-22 14:43:58,153 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 12 [2021-09-22 14:43:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:43:58,154 INFO L470 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2021-09-22 14:43:58,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-09-22 14:43:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2021-09-22 14:43:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-22 14:43:58,157 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:43:58,159 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:43:58,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-22 14:43:58,160 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:43:58,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:43:58,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1840877363, now seen corresponding path program 1 times [2021-09-22 14:43:58,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:43:58,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625817987] [2021-09-22 14:43:58,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:43:58,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:43:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:43:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:43:58,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:43:58,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625817987] [2021-09-22 14:43:58,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625817987] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:43:58,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:43:58,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:43:58,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397168886] [2021-09-22 14:43:58,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:43:58,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:43:58,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:43:58,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:43:58,274 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-09-22 14:43:58,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:43:58,304 INFO L93 Difference]: Finished difference Result 2522 states and 9340 transitions. [2021-09-22 14:43:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:43:58,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2021-09-22 14:43:58,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:43:58,316 INFO L225 Difference]: With dead ends: 2522 [2021-09-22 14:43:58,316 INFO L226 Difference]: Without dead ends: 2202 [2021-09-22 14:43:58,316 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:43:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2021-09-22 14:43:58,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2021-09-22 14:43:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 2201 states have (on average 3.781917310313494) internal successors, (8324), 2201 states have internal predecessors, (8324), 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-09-22 14:43:58,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8324 transitions. [2021-09-22 14:43:58,388 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 8324 transitions. Word has length 14 [2021-09-22 14:43:58,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:43:58,388 INFO L470 AbstractCegarLoop]: Abstraction has 2202 states and 8324 transitions. [2021-09-22 14:43:58,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-09-22 14:43:58,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 8324 transitions. [2021-09-22 14:43:58,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-22 14:43:58,391 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:43:58,391 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:43:58,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-09-22 14:43:58,392 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:43:58,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:43:58,392 INFO L82 PathProgramCache]: Analyzing trace with hash -552293420, now seen corresponding path program 1 times [2021-09-22 14:43:58,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:43:58,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772057835] [2021-09-22 14:43:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:43:58,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:43:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:43:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:43:58,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:43:58,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772057835] [2021-09-22 14:43:58,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772057835] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:43:58,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:43:58,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:43:58,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435600302] [2021-09-22 14:43:58,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:43:58,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:43:58,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:43:58,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:43:58,545 INFO L87 Difference]: Start difference. First operand 2202 states and 8324 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-09-22 14:43:58,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:43:58,656 INFO L93 Difference]: Finished difference Result 2514 states and 9346 transitions. [2021-09-22 14:43:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-22 14:43:58,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 15 [2021-09-22 14:43:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:43:58,668 INFO L225 Difference]: With dead ends: 2514 [2021-09-22 14:43:58,668 INFO L226 Difference]: Without dead ends: 2234 [2021-09-22 14:43:58,668 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.5ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-09-22 14:43:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2021-09-22 14:43:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2234. [2021-09-22 14:43:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 2233 states have (on average 3.774294670846395) internal successors, (8428), 2233 states have internal predecessors, (8428), 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-09-22 14:43:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 8428 transitions. [2021-09-22 14:43:58,776 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 8428 transitions. Word has length 15 [2021-09-22 14:43:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:43:58,777 INFO L470 AbstractCegarLoop]: Abstraction has 2234 states and 8428 transitions. [2021-09-22 14:43:58,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-09-22 14:43:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 8428 transitions. [2021-09-22 14:43:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-22 14:43:58,779 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:43:58,780 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:43:58,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-09-22 14:43:58,781 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:43:58,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:43:58,782 INFO L82 PathProgramCache]: Analyzing trace with hash 397001740, now seen corresponding path program 1 times [2021-09-22 14:43:58,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:43:58,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856013597] [2021-09-22 14:43:58,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:43:58,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:43:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:43:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:43:58,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:43:58,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856013597] [2021-09-22 14:43:58,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856013597] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:43:58,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:43:58,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:43:58,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554523931] [2021-09-22 14:43:58,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:43:58,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:43:58,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:43:58,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:43:58,850 INFO L87 Difference]: Start difference. First operand 2234 states and 8428 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-09-22 14:43:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:43:58,958 INFO L93 Difference]: Finished difference Result 2666 states and 9898 transitions. [2021-09-22 14:43:58,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:43:58,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) Word has length 17 [2021-09-22 14:43:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:43:58,972 INFO L225 Difference]: With dead ends: 2666 [2021-09-22 14:43:58,972 INFO L226 Difference]: Without dead ends: 2498 [2021-09-22 14:43:58,973 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 19.6ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:43:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2021-09-22 14:43:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2154. [2021-09-22 14:43:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2153 states have (on average 3.7398978169995356) internal successors, (8052), 2153 states have internal predecessors, (8052), 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-09-22 14:43:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8052 transitions. [2021-09-22 14:43:59,054 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8052 transitions. Word has length 17 [2021-09-22 14:43:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:43:59,054 INFO L470 AbstractCegarLoop]: Abstraction has 2154 states and 8052 transitions. [2021-09-22 14:43:59,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-09-22 14:43:59,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8052 transitions. [2021-09-22 14:43:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-22 14:43:59,058 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:43:59,058 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:43:59,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-09-22 14:43:59,058 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:43:59,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:43:59,059 INFO L82 PathProgramCache]: Analyzing trace with hash 488162200, now seen corresponding path program 2 times [2021-09-22 14:43:59,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:43:59,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706174453] [2021-09-22 14:43:59,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:43:59,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:43:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:43:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:43:59,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:43:59,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706174453] [2021-09-22 14:43:59,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706174453] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:43:59,187 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:43:59,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-22 14:43:59,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461721468] [2021-09-22 14:43:59,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-22 14:43:59,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:43:59,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-22 14:43:59,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:43:59,192 INFO L87 Difference]: Start difference. First operand 2154 states and 8052 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-09-22 14:43:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:43:59,287 INFO L93 Difference]: Finished difference Result 2410 states and 8910 transitions. [2021-09-22 14:43:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:43:59,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) Word has length 17 [2021-09-22 14:43:59,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:43:59,299 INFO L225 Difference]: With dead ends: 2410 [2021-09-22 14:43:59,300 INFO L226 Difference]: Without dead ends: 2242 [2021-09-22 14:43:59,300 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 36.2ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:43:59,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2021-09-22 14:43:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2034. [2021-09-22 14:43:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 2033 states have (on average 3.7284800787014265) internal successors, (7580), 2033 states have internal predecessors, (7580), 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-09-22 14:43:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 7580 transitions. [2021-09-22 14:43:59,390 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 7580 transitions. Word has length 17 [2021-09-22 14:43:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:43:59,390 INFO L470 AbstractCegarLoop]: Abstraction has 2034 states and 7580 transitions. [2021-09-22 14:43:59,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-09-22 14:43:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 7580 transitions. [2021-09-22 14:43:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-22 14:43:59,394 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:43:59,394 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:43:59,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-09-22 14:43:59,395 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:43:59,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:43:59,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1821107797, now seen corresponding path program 1 times [2021-09-22 14:43:59,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:43:59,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177212120] [2021-09-22 14:43:59,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:43:59,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:43:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:43:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:43:59,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:43:59,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177212120] [2021-09-22 14:43:59,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177212120] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:43:59,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:43:59,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:43:59,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368819501] [2021-09-22 14:43:59,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:43:59,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:43:59,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:43:59,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:43:59,449 INFO L87 Difference]: Start difference. First operand 2034 states and 7580 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-09-22 14:43:59,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:43:59,475 INFO L93 Difference]: Finished difference Result 2070 states and 7044 transitions. [2021-09-22 14:43:59,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:43:59,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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) Word has length 17 [2021-09-22 14:43:59,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:43:59,481 INFO L225 Difference]: With dead ends: 2070 [2021-09-22 14:43:59,481 INFO L226 Difference]: Without dead ends: 1590 [2021-09-22 14:43:59,481 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:43:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2021-09-22 14:43:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1590. [2021-09-22 14:43:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1589 states have (on average 3.3731906859660166) internal successors, (5360), 1589 states have internal predecessors, (5360), 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-09-22 14:43:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 5360 transitions. [2021-09-22 14:43:59,519 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 5360 transitions. Word has length 17 [2021-09-22 14:43:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:43:59,519 INFO L470 AbstractCegarLoop]: Abstraction has 1590 states and 5360 transitions. [2021-09-22 14:43:59,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-09-22 14:43:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 5360 transitions. [2021-09-22 14:43:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-22 14:43:59,522 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:43:59,522 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:43:59,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-09-22 14:43:59,522 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:43:59,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:43:59,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1830758029, now seen corresponding path program 1 times [2021-09-22 14:43:59,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:43:59,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49676564] [2021-09-22 14:43:59,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:43:59,523 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:43:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:43:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:43:59,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:43:59,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49676564] [2021-09-22 14:43:59,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49676564] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:43:59,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:43:59,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:43:59,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589647772] [2021-09-22 14:43:59,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:43:59,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:43:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:43:59,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:43:59,575 INFO L87 Difference]: Start difference. First operand 1590 states and 5360 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-09-22 14:43:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:43:59,605 INFO L93 Difference]: Finished difference Result 1318 states and 4057 transitions. [2021-09-22 14:43:59,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:43:59,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 18 [2021-09-22 14:43:59,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:43:59,608 INFO L225 Difference]: With dead ends: 1318 [2021-09-22 14:43:59,609 INFO L226 Difference]: Without dead ends: 1018 [2021-09-22 14:43:59,609 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 11.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:43:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-09-22 14:43:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2021-09-22 14:43:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 3.0206489675516224) internal successors, (3072), 1017 states have internal predecessors, (3072), 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-09-22 14:43:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3072 transitions. [2021-09-22 14:43:59,629 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3072 transitions. Word has length 18 [2021-09-22 14:43:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:43:59,629 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 3072 transitions. [2021-09-22 14:43:59,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-09-22 14:43:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3072 transitions. [2021-09-22 14:43:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-22 14:43:59,632 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:43:59,632 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:43:59,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-09-22 14:43:59,632 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:43:59,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:43:59,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1732479307, now seen corresponding path program 1 times [2021-09-22 14:43:59,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:43:59,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714068242] [2021-09-22 14:43:59,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:43:59,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:43:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:43:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:43:59,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:43:59,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714068242] [2021-09-22 14:43:59,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714068242] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:43:59,700 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:43:59,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-22 14:43:59,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994127275] [2021-09-22 14:43:59,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:43:59,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:43:59,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:43:59,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:43:59,701 INFO L87 Difference]: Start difference. First operand 1018 states and 3072 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-09-22 14:43:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:43:59,740 INFO L93 Difference]: Finished difference Result 841 states and 2508 transitions. [2021-09-22 14:43:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-22 14:43:59,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) Word has length 20 [2021-09-22 14:43:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:43:59,743 INFO L225 Difference]: With dead ends: 841 [2021-09-22 14:43:59,743 INFO L226 Difference]: Without dead ends: 742 [2021-09-22 14:43:59,743 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 20.1ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-09-22 14:43:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2021-09-22 14:43:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2021-09-22 14:43:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.02834008097166) internal successors, (2244), 741 states have internal predecessors, (2244), 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-09-22 14:43:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2244 transitions. [2021-09-22 14:43:59,758 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2244 transitions. Word has length 20 [2021-09-22 14:43:59,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:43:59,758 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 2244 transitions. [2021-09-22 14:43:59,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-09-22 14:43:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2244 transitions. [2021-09-22 14:43:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-22 14:43:59,760 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:43:59,760 INFO L512 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] [2021-09-22 14:43:59,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-09-22 14:43:59,761 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:43:59,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:43:59,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1080322910, now seen corresponding path program 1 times [2021-09-22 14:43:59,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:43:59,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683759009] [2021-09-22 14:43:59,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:43:59,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:43:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:43:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:43:59,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:43:59,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683759009] [2021-09-22 14:43:59,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683759009] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:43:59,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:43:59,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:43:59,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82313563] [2021-09-22 14:43:59,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:43:59,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:43:59,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:43:59,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:43:59,799 INFO L87 Difference]: Start difference. First operand 742 states and 2244 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-09-22 14:43:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:43:59,820 INFO L93 Difference]: Finished difference Result 964 states and 2839 transitions. [2021-09-22 14:43:59,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:43:59,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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) Word has length 23 [2021-09-22 14:43:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:43:59,822 INFO L225 Difference]: With dead ends: 964 [2021-09-22 14:43:59,822 INFO L226 Difference]: Without dead ends: 748 [2021-09-22 14:43:59,823 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:43:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2021-09-22 14:43:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 742. [2021-09-22 14:43:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 2.9446693657219973) internal successors, (2182), 741 states have internal predecessors, (2182), 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-09-22 14:43:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2182 transitions. [2021-09-22 14:43:59,834 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2182 transitions. Word has length 23 [2021-09-22 14:43:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:43:59,834 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 2182 transitions. [2021-09-22 14:43:59,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-09-22 14:43:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2182 transitions. [2021-09-22 14:43:59,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-22 14:43:59,836 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:43:59,836 INFO L512 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] [2021-09-22 14:43:59,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-09-22 14:43:59,836 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:43:59,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:43:59,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1885648072, now seen corresponding path program 2 times [2021-09-22 14:43:59,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:43:59,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256531820] [2021-09-22 14:43:59,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:43:59,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:43:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:43:59,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:43:59,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:43:59,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256531820] [2021-09-22 14:43:59,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256531820] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:43:59,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:43:59,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:43:59,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057311490] [2021-09-22 14:43:59,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:43:59,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:43:59,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:43:59,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:43:59,882 INFO L87 Difference]: Start difference. First operand 742 states and 2182 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-09-22 14:43:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:43:59,898 INFO L93 Difference]: Finished difference Result 1037 states and 2933 transitions. [2021-09-22 14:43:59,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:43:59,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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) Word has length 23 [2021-09-22 14:43:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:43:59,900 INFO L225 Difference]: With dead ends: 1037 [2021-09-22 14:43:59,900 INFO L226 Difference]: Without dead ends: 663 [2021-09-22 14:43:59,900 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:43:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2021-09-22 14:43:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 659. [2021-09-22 14:43:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 2.6778115501519757) internal successors, (1762), 658 states have internal predecessors, (1762), 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-09-22 14:43:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1762 transitions. [2021-09-22 14:43:59,910 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1762 transitions. Word has length 23 [2021-09-22 14:43:59,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:43:59,910 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 1762 transitions. [2021-09-22 14:43:59,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-09-22 14:43:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1762 transitions. [2021-09-22 14:43:59,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-22 14:43:59,911 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:43:59,912 INFO L512 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] [2021-09-22 14:43:59,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-09-22 14:43:59,912 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:43:59,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:43:59,912 INFO L82 PathProgramCache]: Analyzing trace with hash -598231956, now seen corresponding path program 3 times [2021-09-22 14:43:59,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:43:59,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138826615] [2021-09-22 14:43:59,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:43:59,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:43:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:43:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:43:59,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:43:59,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138826615] [2021-09-22 14:43:59,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138826615] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:43:59,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:43:59,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-22 14:43:59,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186152055] [2021-09-22 14:43:59,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-22 14:43:59,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:43:59,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-22 14:43:59,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:43:59,968 INFO L87 Difference]: Start difference. First operand 659 states and 1762 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-09-22 14:44:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:44:00,020 INFO L93 Difference]: Finished difference Result 621 states and 1686 transitions. [2021-09-22 14:44:00,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:44:00,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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) Word has length 23 [2021-09-22 14:44:00,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:44:00,021 INFO L225 Difference]: With dead ends: 621 [2021-09-22 14:44:00,022 INFO L226 Difference]: Without dead ends: 185 [2021-09-22 14:44:00,022 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 29.3ms TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2021-09-22 14:44:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-09-22 14:44:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-09-22 14:44:00,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.472826086956522) internal successors, (455), 184 states have internal predecessors, (455), 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-09-22 14:44:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 455 transitions. [2021-09-22 14:44:00,025 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 455 transitions. Word has length 23 [2021-09-22 14:44:00,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:44:00,025 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 455 transitions. [2021-09-22 14:44:00,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-09-22 14:44:00,025 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 455 transitions. [2021-09-22 14:44:00,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-09-22 14:44:00,026 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:44:00,026 INFO L512 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] [2021-09-22 14:44:00,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-09-22 14:44:00,026 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:44:00,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:44:00,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2065601654, now seen corresponding path program 1 times [2021-09-22 14:44:00,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:44:00,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532912946] [2021-09-22 14:44:00,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:44:00,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:44:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:44:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:44:00,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:44:00,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532912946] [2021-09-22 14:44:00,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532912946] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:44:00,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:44:00,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-22 14:44:00,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460976001] [2021-09-22 14:44:00,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-22 14:44:00,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:44:00,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-22 14:44:00,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:44:00,175 INFO L87 Difference]: Start difference. First operand 185 states and 455 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-09-22 14:44:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:44:00,242 INFO L93 Difference]: Finished difference Result 236 states and 574 transitions. [2021-09-22 14:44:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-22 14:44:00,243 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) Word has length 27 [2021-09-22 14:44:00,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:44:00,243 INFO L225 Difference]: With dead ends: 236 [2021-09-22 14:44:00,244 INFO L226 Difference]: Without dead ends: 93 [2021-09-22 14:44:00,244 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 68.4ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-09-22 14:44:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-09-22 14:44:00,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-09-22 14:44:00,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 92 states have internal predecessors, (199), 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-09-22 14:44:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 199 transitions. [2021-09-22 14:44:00,246 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 199 transitions. Word has length 27 [2021-09-22 14:44:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:44:00,246 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 199 transitions. [2021-09-22 14:44:00,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-09-22 14:44:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 199 transitions. [2021-09-22 14:44:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-09-22 14:44:00,247 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:44:00,247 INFO L512 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] [2021-09-22 14:44:00,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-09-22 14:44:00,247 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:44:00,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:44:00,247 INFO L82 PathProgramCache]: Analyzing trace with hash -493015646, now seen corresponding path program 2 times [2021-09-22 14:44:00,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:44:00,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117232245] [2021-09-22 14:44:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:44:00,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:44:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:44:00,271 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-09-22 14:44:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:44:00,326 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-09-22 14:44:00,326 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-09-22 14:44:00,326 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:44:00,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:44:00,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-09-22 14:44:00,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-09-22 14:44:00,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-09-22 14:44:00,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION [2021-09-22 14:44:00,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:44:00,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-09-22 14:44:00,332 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-09-22 14:44:00,332 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-22 14:44:00,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.09 02:44:00 BasicIcfg [2021-09-22 14:44:00,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-22 14:44:00,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-22 14:44:00,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-22 14:44:00,408 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-22 14:44:00,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:43:50" (3/4) ... [2021-09-22 14:44:00,409 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-09-22 14:44:00,496 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-22 14:44:00,496 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-22 14:44:00,497 INFO L168 Benchmark]: Toolchain (without parser) took 12120.88 ms. Allocated memory was 54.5 MB in the beginning and 396.4 MB in the end (delta: 341.8 MB). Free memory was 31.9 MB in the beginning and 150.5 MB in the end (delta: -118.5 MB). Peak memory consumption was 223.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:44:00,498 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 36.9 MB in the end (delta: 44.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-09-22 14:44:00,498 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.34 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.8 MB in the beginning and 37.3 MB in the end (delta: -5.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. [2021-09-22 14:44:00,498 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.25 ms. Allocated memory is still 67.1 MB. Free memory was 37.1 MB in the beginning and 47.8 MB in the end (delta: -10.7 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. [2021-09-22 14:44:00,499 INFO L168 Benchmark]: Boogie Preprocessor took 43.03 ms. Allocated memory is still 67.1 MB. Free memory was 47.8 MB in the beginning and 45.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:44:00,499 INFO L168 Benchmark]: RCFGBuilder took 1335.03 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 45.4 MB in the beginning and 40.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 29.3 MB. Max. memory is 16.1 GB. [2021-09-22 14:44:00,499 INFO L168 Benchmark]: TraceAbstraction took 10091.55 ms. Allocated memory was 81.8 MB in the beginning and 396.4 MB in the end (delta: 314.6 MB). Free memory was 40.1 MB in the beginning and 169.3 MB in the end (delta: -129.3 MB). Peak memory consumption was 183.7 MB. Max. memory is 16.1 GB. [2021-09-22 14:44:00,499 INFO L168 Benchmark]: Witness Printer took 89.02 ms. Allocated memory is still 396.4 MB. Free memory was 169.3 MB in the beginning and 150.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-09-22 14:44:00,502 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.15 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 36.9 MB in the end (delta: 44.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 484.34 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.8 MB in the beginning and 37.3 MB in the end (delta: -5.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.25 ms. Allocated memory is still 67.1 MB. Free memory was 37.1 MB in the beginning and 47.8 MB in the end (delta: -10.7 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.03 ms. Allocated memory is still 67.1 MB. Free memory was 47.8 MB in the beginning and 45.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1335.03 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 45.4 MB in the beginning and 40.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 29.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10091.55 ms. Allocated memory was 81.8 MB in the beginning and 396.4 MB in the end (delta: 314.6 MB). Free memory was 40.1 MB in the beginning and 169.3 MB in the end (delta: -129.3 MB). Peak memory consumption was 183.7 MB. Max. memory is 16.1 GB. * Witness Printer took 89.02 ms. Allocated memory is still 396.4 MB. Free memory was 169.3 MB in the beginning and 150.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6685.8ms, 140 PlacesBefore, 46 PlacesAfterwards, 129 TransitionsBefore, 34 TransitionsAfterwards, 2878 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 6593 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3871, positive: 3700, positive conditional: 0, positive unconditional: 3700, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2005, positive: 1956, positive conditional: 0, positive unconditional: 1956, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2005, positive: 1934, positive conditional: 0, positive unconditional: 1934, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 309, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 290, negative conditional: 0, negative unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3871, positive: 1744, positive conditional: 0, positive unconditional: 1744, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 2005, unknown conditional: 0, unknown unconditional: 2005] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 226, Positive conditional cache size: 0, Positive unconditional cache size: 226, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1189; [L847] FCALL, FORK 0 pthread_create(&t1189, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1190; [L849] FCALL, FORK 0 pthread_create(&t1190, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1191; [L851] FCALL, FORK 0 pthread_create(&t1191, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1192; [L853] FCALL, FORK 0 pthread_create(&t1192, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L770] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L782] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 9907.6ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 44.1ms, AutomataDifference: 866.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6822.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 491 SDtfs, 781 SDslu, 1031 SDs, 0 SdLazy, 306 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 323.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 265.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3162occurred in iteration=0, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 777.5ms AutomataMinimizationTime, 13 MinimizatonAttempts, 562 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 37.3ms SsaConstructionTime, 338.0ms SatisfiabilityAnalysisTime, 753.4ms InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 1189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-09-22 14:44:00,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...