./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix051_pso.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/mix051_pso.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 a42152209f59af399983139056a26d6eda6f8344 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:44:44,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-22 14:44:44,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-22 14:44:44,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-22 14:44:44,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-22 14:44:44,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-22 14:44:44,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-22 14:44:44,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-22 14:44:44,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-22 14:44:44,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-22 14:44:44,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-22 14:44:44,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-22 14:44:44,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-22 14:44:44,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-22 14:44:44,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-22 14:44:44,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-22 14:44:44,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-22 14:44:44,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-22 14:44:44,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-22 14:44:44,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-22 14:44:44,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-22 14:44:44,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-22 14:44:44,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-22 14:44:44,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-22 14:44:44,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-22 14:44:44,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-22 14:44:44,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-22 14:44:44,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-22 14:44:44,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-22 14:44:44,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-22 14:44:44,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-22 14:44:44,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-22 14:44:44,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-22 14:44:44,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-22 14:44:44,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-22 14:44:44,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-22 14:44:44,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-22 14:44:44,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-22 14:44:44,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-22 14:44:44,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-22 14:44:44,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-22 14:44:44,508 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:44:44,538 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-22 14:44:44,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-22 14:44:44,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-22 14:44:44,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-22 14:44:44,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-22 14:44:44,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-22 14:44:44,542 INFO L138 SettingsManager]: * Use SBE=true [2021-09-22 14:44:44,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-22 14:44:44,542 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-22 14:44:44,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-22 14:44:44,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-22 14:44:44,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-22 14:44:44,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-22 14:44:44,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-22 14:44:44,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-22 14:44:44,544 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-22 14:44:44,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-22 14:44:44,544 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-22 14:44:44,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-22 14:44:44,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-22 14:44:44,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-22 14:44:44,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-22 14:44:44,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:44:44,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-22 14:44:44,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-22 14:44:44,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-22 14:44:44,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-22 14:44:44,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-22 14:44:44,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-22 14:44:44,551 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-22 14:44:44,551 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 -> a42152209f59af399983139056a26d6eda6f8344 [2021-09-22 14:44:44,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-22 14:44:44,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-22 14:44:44,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-22 14:44:44,839 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-22 14:44:44,840 INFO L275 PluginConnector]: CDTParser initialized [2021-09-22 14:44:44,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix051_pso.opt.i [2021-09-22 14:44:44,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f038d5923/504c858f16c74680aef637680a589f1c/FLAGc2ba4f620 [2021-09-22 14:44:45,365 INFO L306 CDTParser]: Found 1 translation units. [2021-09-22 14:44:45,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_pso.opt.i [2021-09-22 14:44:45,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f038d5923/504c858f16c74680aef637680a589f1c/FLAGc2ba4f620 [2021-09-22 14:44:45,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f038d5923/504c858f16c74680aef637680a589f1c [2021-09-22 14:44:45,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-22 14:44:45,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-22 14:44:45,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-22 14:44:45,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-22 14:44:45,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-22 14:44:45,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:44:45" (1/1) ... [2021-09-22 14:44:45,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c78ac5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:44:45, skipping insertion in model container [2021-09-22 14:44:45,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:44:45" (1/1) ... [2021-09-22 14:44:45,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-22 14:44:45,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-22 14:44:46,075 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/mix051_pso.opt.i[948,961] [2021-09-22 14:44:46,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:44:46,209 INFO L203 MainTranslator]: Completed pre-run [2021-09-22 14:44:46,217 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/mix051_pso.opt.i[948,961] [2021-09-22 14:44:46,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:44:46,302 INFO L208 MainTranslator]: Completed translation [2021-09-22 14:44:46,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:44:46 WrapperNode [2021-09-22 14:44:46,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-22 14:44:46,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-22 14:44:46,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-22 14:44:46,304 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-22 14:44:46,309 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:44:46" (1/1) ... [2021-09-22 14:44:46,322 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:44:46" (1/1) ... [2021-09-22 14:44:46,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-22 14:44:46,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-22 14:44:46,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-22 14:44:46,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-22 14:44:46,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:44:46" (1/1) ... [2021-09-22 14:44:46,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:44:46" (1/1) ... [2021-09-22 14:44:46,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:44:46" (1/1) ... [2021-09-22 14:44:46,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:44:46" (1/1) ... [2021-09-22 14:44:46,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:44:46" (1/1) ... [2021-09-22 14:44:46,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:44:46" (1/1) ... [2021-09-22 14:44:46,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:44:46" (1/1) ... [2021-09-22 14:44:46,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-22 14:44:46,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-22 14:44:46,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-22 14:44:46,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-22 14:44:46,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:44:46" (1/1) ... [2021-09-22 14:44:46,371 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:44:46,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-22 14:44:46,390 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:44:46,435 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:44:46,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-09-22 14:44:46,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-09-22 14:44:46,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-22 14:44:46,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-09-22 14:44:46,448 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-09-22 14:44:46,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-09-22 14:44:46,448 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-09-22 14:44:46,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-09-22 14:44:46,448 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-09-22 14:44:46,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-09-22 14:44:46,448 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-09-22 14:44:46,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-09-22 14:44:46,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-22 14:44:46,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-09-22 14:44:46,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-22 14:44:46,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-22 14:44:46,450 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:44:47,369 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-22 14:44:47,369 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-09-22 14:44:47,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:44:47 BoogieIcfgContainer [2021-09-22 14:44:47,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-22 14:44:47,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-22 14:44:47,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-22 14:44:47,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-22 14:44:47,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 02:44:45" (1/3) ... [2021-09-22 14:44:47,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad64140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:44:47, skipping insertion in model container [2021-09-22 14:44:47,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:44:46" (2/3) ... [2021-09-22 14:44:47,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad64140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:44:47, skipping insertion in model container [2021-09-22 14:44:47,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:44:47" (3/3) ... [2021-09-22 14:44:47,379 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt.i [2021-09-22 14:44:47,382 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-09-22 14:44:47,382 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-22 14:44:47,383 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-09-22 14:44:47,383 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-09-22 14:44:47,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,413 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,413 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,414 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,414 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,416 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,416 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,418 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,418 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,419 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,419 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,440 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,440 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,441 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,441 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,441 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,441 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,441 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,442 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,449 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,451 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,454 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,455 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,455 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,456 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,457 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,458 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,458 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:44:47,459 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-09-22 14:44:47,493 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-22 14:44:47,500 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:44:47,501 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-09-22 14:44:47,524 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-09-22 14:44:47,532 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 270 flow [2021-09-22 14:44:47,534 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 270 flow [2021-09-22 14:44:47,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 270 flow [2021-09-22 14:44:47,581 INFO L129 PetriNetUnfolder]: 2/121 cut-off events. [2021-09-22 14:44:47,582 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-09-22 14:44:47,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2021-09-22 14:44:47,588 INFO L116 LiptonReduction]: Number of co-enabled transitions 2568 [2021-09-22 14:44:51,874 INFO L131 LiptonReduction]: Checked pairs total: 6742 [2021-09-22 14:44:51,875 INFO L133 LiptonReduction]: Total number of compositions: 105 [2021-09-22 14:44:51,882 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 32 transitions, 84 flow [2021-09-22 14:44:51,970 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2218 states, 2215 states have (on average 3.9873589164785552) internal successors, (8832), 2217 states have internal predecessors, (8832), 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:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 2218 states, 2215 states have (on average 3.9873589164785552) internal successors, (8832), 2217 states have internal predecessors, (8832), 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:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-09-22 14:44:51,983 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:44:51,984 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:44:51,985 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:44:51,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:44:51,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1949756042, now seen corresponding path program 1 times [2021-09-22 14:44:51,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:44:51,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728732648] [2021-09-22 14:44:51,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:44:51,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:44:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:44:52,223 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:52,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:44:52,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728732648] [2021-09-22 14:44:52,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728732648] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:44:52,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:44:52,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-09-22 14:44:52,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948051911] [2021-09-22 14:44:52,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:44:52,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:44:52,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:44:52,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:44:52,247 INFO L87 Difference]: Start difference. First operand has 2218 states, 2215 states have (on average 3.9873589164785552) internal successors, (8832), 2217 states have internal predecessors, (8832), 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:44:52,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:44:52,325 INFO L93 Difference]: Finished difference Result 1834 states and 6880 transitions. [2021-09-22 14:44:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:44:52,327 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:44:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:44:52,359 INFO L225 Difference]: With dead ends: 1834 [2021-09-22 14:44:52,359 INFO L226 Difference]: Without dead ends: 1770 [2021-09-22 14:44:52,360 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:44:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2021-09-22 14:44:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1770. [2021-09-22 14:44:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1769 states have (on average 3.771622385528547) internal successors, (6672), 1769 states have internal predecessors, (6672), 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:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 6672 transitions. [2021-09-22 14:44:52,493 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 6672 transitions. Word has length 9 [2021-09-22 14:44:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:44:52,493 INFO L470 AbstractCegarLoop]: Abstraction has 1770 states and 6672 transitions. [2021-09-22 14:44:52,493 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:44:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 6672 transitions. [2021-09-22 14:44:52,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-22 14:44:52,500 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:44:52,500 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:44:52,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-22 14:44:52,501 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:44:52,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:44:52,501 INFO L82 PathProgramCache]: Analyzing trace with hash 46255032, now seen corresponding path program 1 times [2021-09-22 14:44:52,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:44:52,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913061164] [2021-09-22 14:44:52,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:44:52,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:44:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:44:52,605 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:52,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:44:52,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913061164] [2021-09-22 14:44:52,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913061164] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:44:52,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:44:52,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:44:52,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459234659] [2021-09-22 14:44:52,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:44:52,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:44:52,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:44:52,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:44:52,610 INFO L87 Difference]: Start difference. First operand 1770 states and 6672 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:44:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:44:52,648 INFO L93 Difference]: Finished difference Result 2010 states and 7324 transitions. [2021-09-22 14:44:52,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:44:52,648 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:44:52,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:44:52,657 INFO L225 Difference]: With dead ends: 2010 [2021-09-22 14:44:52,657 INFO L226 Difference]: Without dead ends: 1690 [2021-09-22 14:44:52,658 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:44:52,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2021-09-22 14:44:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1690. [2021-09-22 14:44:52,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1689 states have (on average 3.734754292480758) internal successors, (6308), 1689 states have internal predecessors, (6308), 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:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 6308 transitions. [2021-09-22 14:44:52,730 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 6308 transitions. Word has length 12 [2021-09-22 14:44:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:44:52,730 INFO L470 AbstractCegarLoop]: Abstraction has 1690 states and 6308 transitions. [2021-09-22 14:44:52,730 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:44:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 6308 transitions. [2021-09-22 14:44:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-22 14:44:52,731 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:44:52,731 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:44:52,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-22 14:44:52,732 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:44:52,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:44:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash 800858122, now seen corresponding path program 1 times [2021-09-22 14:44:52,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:44:52,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307710487] [2021-09-22 14:44:52,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:44:52,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:44:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:44:52,843 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:52,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:44:52,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307710487] [2021-09-22 14:44:52,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307710487] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:44:52,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:44:52,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:44:52,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790820349] [2021-09-22 14:44:52,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:44:52,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:44:52,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:44:52,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:44:52,847 INFO L87 Difference]: Start difference. First operand 1690 states and 6308 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:44:52,877 INFO L93 Difference]: Finished difference Result 1626 states and 5472 transitions. [2021-09-22 14:44:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:44:52,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2021-09-22 14:44:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:44:52,885 INFO L225 Difference]: With dead ends: 1626 [2021-09-22 14:44:52,885 INFO L226 Difference]: Without dead ends: 1306 [2021-09-22 14:44:52,885 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:44:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2021-09-22 14:44:52,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1306. [2021-09-22 14:44:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1305 states have (on average 3.3624521072796933) internal successors, (4388), 1305 states have internal predecessors, (4388), 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:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 4388 transitions. [2021-09-22 14:44:52,917 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 4388 transitions. Word has length 13 [2021-09-22 14:44:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:44:52,918 INFO L470 AbstractCegarLoop]: Abstraction has 1306 states and 4388 transitions. [2021-09-22 14:44:52,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 4388 transitions. [2021-09-22 14:44:52,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-22 14:44:52,919 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:44:52,919 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:44:52,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-09-22 14:44:52,920 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:44:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:44:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash -742996795, now seen corresponding path program 1 times [2021-09-22 14:44:52,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:44:52,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921358353] [2021-09-22 14:44:52,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:44:52,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:44:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:44:52,962 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:52,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:44:52,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921358353] [2021-09-22 14:44:52,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921358353] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:44:52,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:44:52,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:44:52,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744557102] [2021-09-22 14:44:52,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:44:52,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:44:52,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:44:52,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:44:52,965 INFO L87 Difference]: Start difference. First operand 1306 states and 4388 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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:44:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:44:53,028 INFO L93 Difference]: Finished difference Result 1006 states and 3019 transitions. [2021-09-22 14:44:53,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:44:53,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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:44:53,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:44:53,044 INFO L225 Difference]: With dead ends: 1006 [2021-09-22 14:44:53,044 INFO L226 Difference]: Without dead ends: 794 [2021-09-22 14:44:53,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:44:53,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2021-09-22 14:44:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2021-09-22 14:44:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 2.9508196721311477) internal successors, (2340), 793 states have internal predecessors, (2340), 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:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 2340 transitions. [2021-09-22 14:44:53,060 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 2340 transitions. Word has length 15 [2021-09-22 14:44:53,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:44:53,060 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 2340 transitions. [2021-09-22 14:44:53,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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:44:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 2340 transitions. [2021-09-22 14:44:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-22 14:44:53,062 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:44:53,062 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:44:53,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-09-22 14:44:53,062 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:44:53,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:44:53,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1990309966, now seen corresponding path program 1 times [2021-09-22 14:44:53,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:44:53,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875525571] [2021-09-22 14:44:53,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:44:53,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:44:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:44:53,133 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:53,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:44:53,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875525571] [2021-09-22 14:44:53,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875525571] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:44:53,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:44:53,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:44:53,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330368099] [2021-09-22 14:44:53,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:44:53,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:44:53,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:44:53,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:44:53,135 INFO L87 Difference]: Start difference. First operand 794 states and 2340 transitions. Second operand has 4 states, 3 states have (on average 6.0) 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:44:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:44:53,158 INFO L93 Difference]: Finished difference Result 1170 states and 3302 transitions. [2021-09-22 14:44:53,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:44:53,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) 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:44:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:44:53,162 INFO L225 Difference]: With dead ends: 1170 [2021-09-22 14:44:53,162 INFO L226 Difference]: Without dead ends: 816 [2021-09-22 14:44:53,162 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:44:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2021-09-22 14:44:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 776. [2021-09-22 14:44:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 2.8103225806451615) internal successors, (2178), 775 states have internal predecessors, (2178), 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:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 2178 transitions. [2021-09-22 14:44:53,188 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 2178 transitions. Word has length 18 [2021-09-22 14:44:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:44:53,188 INFO L470 AbstractCegarLoop]: Abstraction has 776 states and 2178 transitions. [2021-09-22 14:44:53,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) 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:44:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 2178 transitions. [2021-09-22 14:44:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-22 14:44:53,190 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:44:53,190 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:44:53,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-09-22 14:44:53,191 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:44:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:44:53,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2066497276, now seen corresponding path program 1 times [2021-09-22 14:44:53,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:44:53,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218597900] [2021-09-22 14:44:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:44:53,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:44:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:44:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:44:53,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:44:53,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218597900] [2021-09-22 14:44:53,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218597900] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:44:53,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:44:53,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-22 14:44:53,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001660491] [2021-09-22 14:44:53,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:44:53,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:44:53,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:44:53,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:44:53,306 INFO L87 Difference]: Start difference. First operand 776 states and 2178 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:44:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:44:53,347 INFO L93 Difference]: Finished difference Result 621 states and 1692 transitions. [2021-09-22 14:44:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-22 14:44:53,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:44:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:44:53,350 INFO L225 Difference]: With dead ends: 621 [2021-09-22 14:44:53,350 INFO L226 Difference]: Without dead ends: 544 [2021-09-22 14:44:53,351 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 35.6ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-09-22 14:44:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-09-22 14:44:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2021-09-22 14:44:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 2.7624309392265194) internal successors, (1500), 543 states have internal predecessors, (1500), 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:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1500 transitions. [2021-09-22 14:44:53,360 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1500 transitions. Word has length 18 [2021-09-22 14:44:53,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:44:53,361 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 1500 transitions. [2021-09-22 14:44:53,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:44:53,361 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1500 transitions. [2021-09-22 14:44:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:44:53,362 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:44:53,362 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] [2021-09-22 14:44:53,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-09-22 14:44:53,362 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:44:53,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:44:53,363 INFO L82 PathProgramCache]: Analyzing trace with hash 316956413, now seen corresponding path program 1 times [2021-09-22 14:44:53,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:44:53,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904554823] [2021-09-22 14:44:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:44:53,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:44:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:44:53,452 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:53,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:44:53,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904554823] [2021-09-22 14:44:53,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904554823] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:44:53,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:44:53,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-22 14:44:53,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133229863] [2021-09-22 14:44:53,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-22 14:44:53,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:44:53,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-22 14:44:53,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:44:53,454 INFO L87 Difference]: Start difference. First operand 544 states and 1500 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:44:53,502 INFO L93 Difference]: Finished difference Result 508 states and 1427 transitions. [2021-09-22 14:44:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:44:53,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2021-09-22 14:44:53,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:44:53,504 INFO L225 Difference]: With dead ends: 508 [2021-09-22 14:44:53,504 INFO L226 Difference]: Without dead ends: 314 [2021-09-22 14:44:53,504 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 27.1ms TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2021-09-22 14:44:53,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-09-22 14:44:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2021-09-22 14:44:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.7156549520766773) internal successors, (850), 313 states have internal predecessors, (850), 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:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 850 transitions. [2021-09-22 14:44:53,510 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 850 transitions. Word has length 21 [2021-09-22 14:44:53,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:44:53,510 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 850 transitions. [2021-09-22 14:44:53,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 850 transitions. [2021-09-22 14:44:53,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-09-22 14:44:53,511 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:44:53,511 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] [2021-09-22 14:44:53,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-09-22 14:44:53,511 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:44:53,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:44:53,512 INFO L82 PathProgramCache]: Analyzing trace with hash -913776521, now seen corresponding path program 1 times [2021-09-22 14:44:53,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:44:53,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290760093] [2021-09-22 14:44:53,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:44:53,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:44:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:44:53,601 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:53,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:44:53,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290760093] [2021-09-22 14:44:53,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290760093] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:44:53,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:44:53,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:44:53,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650029397] [2021-09-22 14:44:53,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:44:53,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:44:53,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:44:53,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:44:53,603 INFO L87 Difference]: Start difference. First operand 314 states and 850 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:44:53,621 INFO L93 Difference]: Finished difference Result 425 states and 1138 transitions. [2021-09-22 14:44:53,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:44:53,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2021-09-22 14:44:53,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:44:53,622 INFO L225 Difference]: With dead ends: 425 [2021-09-22 14:44:53,622 INFO L226 Difference]: Without dead ends: 146 [2021-09-22 14:44:53,623 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:44:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-09-22 14:44:53,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-09-22 14:44:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.4275862068965517) internal successors, (352), 145 states have internal predecessors, (352), 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:53,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 352 transitions. [2021-09-22 14:44:53,625 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 352 transitions. Word has length 25 [2021-09-22 14:44:53,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:44:53,626 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 352 transitions. [2021-09-22 14:44:53,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:53,626 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 352 transitions. [2021-09-22 14:44:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-09-22 14:44:53,626 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:44:53,627 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] [2021-09-22 14:44:53,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-09-22 14:44:53,627 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:44:53,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:44:53,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1328308189, now seen corresponding path program 2 times [2021-09-22 14:44:53,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:44:53,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435741272] [2021-09-22 14:44:53,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:44:53,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:44:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:44:53,698 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:53,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:44:53,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435741272] [2021-09-22 14:44:53,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435741272] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:44:53,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:44:53,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:44:53,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348288503] [2021-09-22 14:44:53,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:44:53,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:44:53,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:44:53,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:44:53,700 INFO L87 Difference]: Start difference. First operand 146 states and 352 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:44:53,744 INFO L93 Difference]: Finished difference Result 197 states and 471 transitions. [2021-09-22 14:44:53,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-22 14:44:53,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2021-09-22 14:44:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:44:53,745 INFO L225 Difference]: With dead ends: 197 [2021-09-22 14:44:53,745 INFO L226 Difference]: Without dead ends: 114 [2021-09-22 14:44:53,745 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:44:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-09-22 14:44:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2021-09-22 14:44:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.257425742574257) internal successors, (228), 101 states have internal predecessors, (228), 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:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 228 transitions. [2021-09-22 14:44:53,747 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 228 transitions. Word has length 25 [2021-09-22 14:44:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:44:53,747 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 228 transitions. [2021-09-22 14:44:53,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 228 transitions. [2021-09-22 14:44:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-09-22 14:44:53,748 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:44:53,748 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] [2021-09-22 14:44:53,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-09-22 14:44:53,748 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:44:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:44:53,748 INFO L82 PathProgramCache]: Analyzing trace with hash -536719901, now seen corresponding path program 3 times [2021-09-22 14:44:53,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:44:53,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195368753] [2021-09-22 14:44:53,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:44:53,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:44:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:44:53,840 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:53,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:44:53,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195368753] [2021-09-22 14:44:53,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195368753] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:44:53,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:44:53,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:44:53,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045368018] [2021-09-22 14:44:53,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:44:53,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:44:53,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:44:53,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:44:53,841 INFO L87 Difference]: Start difference. First operand 102 states and 228 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:44:53,856 INFO L93 Difference]: Finished difference Result 141 states and 315 transitions. [2021-09-22 14:44:53,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:44:53,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2021-09-22 14:44:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:44:53,857 INFO L225 Difference]: With dead ends: 141 [2021-09-22 14:44:53,857 INFO L226 Difference]: Without dead ends: 80 [2021-09-22 14:44:53,858 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:44:53,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-09-22 14:44:53,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-09-22 14:44:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 2.1012658227848102) internal successors, (166), 79 states have internal predecessors, (166), 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:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 166 transitions. [2021-09-22 14:44:53,859 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 166 transitions. Word has length 25 [2021-09-22 14:44:53,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:44:53,859 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 166 transitions. [2021-09-22 14:44:53,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 166 transitions. [2021-09-22 14:44:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-09-22 14:44:53,860 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:44:53,860 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] [2021-09-22 14:44:53,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-09-22 14:44:53,860 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:44:53,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:44:53,860 INFO L82 PathProgramCache]: Analyzing trace with hash -115003705, now seen corresponding path program 4 times [2021-09-22 14:44:53,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:44:53,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716996032] [2021-09-22 14:44:53,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:44:53,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:44:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:44:54,002 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:54,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:44:54,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716996032] [2021-09-22 14:44:54,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716996032] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:44:54,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:44:54,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-22 14:44:54,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707444640] [2021-09-22 14:44:54,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-22 14:44:54,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:44:54,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-22 14:44:54,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:44:54,004 INFO L87 Difference]: Start difference. First operand 80 states and 166 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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:54,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:44:54,070 INFO L93 Difference]: Finished difference Result 99 states and 201 transitions. [2021-09-22 14:44:54,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:44:54,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2021-09-22 14:44:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:44:54,071 INFO L225 Difference]: With dead ends: 99 [2021-09-22 14:44:54,071 INFO L226 Difference]: Without dead ends: 52 [2021-09-22 14:44:54,071 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.7ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-09-22 14:44:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-09-22 14:44:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-09-22 14:44:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 51 states have internal predecessors, (90), 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:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2021-09-22 14:44:54,073 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 25 [2021-09-22 14:44:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:44:54,073 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2021-09-22 14:44:54,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2021-09-22 14:44:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-09-22 14:44:54,075 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:44:54,075 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] [2021-09-22 14:44:54,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-09-22 14:44:54,075 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:44:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:44:54,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2067102973, now seen corresponding path program 5 times [2021-09-22 14:44:54,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:44:54,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009196700] [2021-09-22 14:44:54,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:44:54,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:44:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:44:54,102 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-09-22 14:44:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:44:54,172 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-09-22 14:44:54,172 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-09-22 14:44:54,174 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:44:54,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:44:54,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-09-22 14:44:54,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-09-22 14:44:54,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-09-22 14:44:54,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION [2021-09-22 14:44:54,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:44:54,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-09-22 14:44:54,182 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-09-22 14:44:54,182 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-22 14:44:54,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.09 02:44:54 BasicIcfg [2021-09-22 14:44:54,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-22 14:44:54,266 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-22 14:44:54,266 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-22 14:44:54,266 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-22 14:44:54,267 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:44:47" (3/4) ... [2021-09-22 14:44:54,268 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-09-22 14:44:54,353 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-22 14:44:54,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-22 14:44:54,354 INFO L168 Benchmark]: Toolchain (without parser) took 8472.98 ms. Allocated memory was 56.6 MB in the beginning and 207.6 MB in the end (delta: 151.0 MB). Free memory was 33.8 MB in the beginning and 149.1 MB in the end (delta: -115.3 MB). Peak memory consumption was 118.0 MB. Max. memory is 16.1 GB. [2021-09-22 14:44:54,355 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 56.6 MB. Free memory is still 38.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-09-22 14:44:54,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 420.87 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 33.6 MB in the beginning and 40.1 MB in the end (delta: -6.5 MB). Peak memory consumption was 11.8 MB. Max. memory is 16.1 GB. [2021-09-22 14:44:54,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.14 ms. Allocated memory is still 69.2 MB. Free memory was 40.1 MB in the beginning and 37.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:44:54,355 INFO L168 Benchmark]: Boogie Preprocessor took 25.03 ms. Allocated memory is still 69.2 MB. Free memory was 37.6 MB in the beginning and 51.0 MB in the end (delta: -13.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-09-22 14:44:54,356 INFO L168 Benchmark]: RCFGBuilder took 1005.53 ms. Allocated memory was 69.2 MB in the beginning and 83.9 MB in the end (delta: 14.7 MB). Free memory was 51.0 MB in the beginning and 54.6 MB in the end (delta: -3.7 MB). Peak memory consumption was 29.2 MB. Max. memory is 16.1 GB. [2021-09-22 14:44:54,356 INFO L168 Benchmark]: TraceAbstraction took 6893.31 ms. Allocated memory was 83.9 MB in the beginning and 207.6 MB in the end (delta: 123.7 MB). Free memory was 54.2 MB in the beginning and 88.9 MB in the end (delta: -34.7 MB). Peak memory consumption was 89.4 MB. Max. memory is 16.1 GB. [2021-09-22 14:44:54,356 INFO L168 Benchmark]: Witness Printer took 87.40 ms. Allocated memory is still 207.6 MB. Free memory was 88.9 MB in the beginning and 149.1 MB in the end (delta: -60.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:44:54,357 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.13 ms. Allocated memory is still 56.6 MB. Free memory is still 38.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 420.87 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 33.6 MB in the beginning and 40.1 MB in the end (delta: -6.5 MB). Peak memory consumption was 11.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 36.14 ms. Allocated memory is still 69.2 MB. Free memory was 40.1 MB in the beginning and 37.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.03 ms. Allocated memory is still 69.2 MB. Free memory was 37.6 MB in the beginning and 51.0 MB in the end (delta: -13.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1005.53 ms. Allocated memory was 69.2 MB in the beginning and 83.9 MB in the end (delta: 14.7 MB). Free memory was 51.0 MB in the beginning and 54.6 MB in the end (delta: -3.7 MB). Peak memory consumption was 29.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6893.31 ms. Allocated memory was 83.9 MB in the beginning and 207.6 MB in the end (delta: 123.7 MB). Free memory was 54.2 MB in the beginning and 88.9 MB in the end (delta: -34.7 MB). Peak memory consumption was 89.4 MB. Max. memory is 16.1 GB. * Witness Printer took 87.40 ms. Allocated memory is still 207.6 MB. Free memory was 88.9 MB in the beginning and 149.1 MB in the end (delta: -60.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4340.6ms, 136 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 32 TransitionsAfterwards, 2568 CoEnabledTransitionPairs, 8 FixpointIterations, 42 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 6742 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3193, positive: 2998, positive conditional: 0, positive unconditional: 2998, negative: 195, negative conditional: 0, negative unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1696, positive: 1642, positive conditional: 0, positive unconditional: 1642, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1696, positive: 1624, positive conditional: 0, positive unconditional: 1624, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 296, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3193, positive: 1356, positive conditional: 0, positive unconditional: 1356, negative: 141, negative conditional: 0, negative unconditional: 141, unknown: 1696, unknown conditional: 0, unknown unconditional: 1696] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 167, Positive conditional cache size: 0, Positive unconditional cache size: 167, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - 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_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1365; [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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 t1366; [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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 t1367; [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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 t1368; [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L768] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L788] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L789] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? 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_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L790] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? 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_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L792] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 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; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, 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=1, 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 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, 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=1, 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 6687.8ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 28.2ms, AutomataDifference: 574.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4469.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 345 SDtfs, 545 SDslu, 676 SDs, 0 SdLazy, 162 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 155.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 202.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2218occurred in iteration=0, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 290.4ms AutomataMinimizationTime, 11 MinimizatonAttempts, 52 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 38.7ms SsaConstructionTime, 371.0ms SatisfiabilityAnalysisTime, 648.1ms InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 708 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:54,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...