/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/pthread-wmm/mix027_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 10:53:13,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 10:53:13,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 10:53:13,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 10:53:13,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 10:53:13,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 10:53:13,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 10:53:13,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 10:53:13,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 10:53:13,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 10:53:13,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 10:53:13,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 10:53:13,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 10:53:13,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 10:53:13,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 10:53:13,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 10:53:13,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 10:53:13,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 10:53:13,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 10:53:13,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 10:53:13,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 10:53:13,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 10:53:13,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 10:53:13,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 10:53:13,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 10:53:13,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 10:53:13,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 10:53:13,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 10:53:13,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 10:53:13,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 10:53:13,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 10:53:13,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 10:53:13,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 10:53:13,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 10:53:13,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 10:53:13,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 10:53:13,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 10:53:13,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 10:53:13,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 10:53:13,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 10:53:13,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 10:53:13,528 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 10:53:13,588 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 10:53:13,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 10:53:13,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 10:53:13,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 10:53:13,595 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 10:53:13,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 10:53:13,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 10:53:13,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 10:53:13,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 10:53:13,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 10:53:13,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 10:53:13,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 10:53:13,598 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 10:53:13,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 10:53:13,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 10:53:13,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 10:53:13,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 10:53:13,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 10:53:13,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 10:53:13,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 10:53:13,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 10:53:13,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 10:53:13,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 10:53:13,602 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 10:53:13,602 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 10:53:13,603 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 [2020-12-22 10:53:13,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 10:53:14,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 10:53:14,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 10:53:14,029 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 10:53:14,030 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 10:53:14,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix027_power.opt.i [2020-12-22 10:53:14,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2edb8a4e/e95a5b231a194a44b9778ed5a4d77906/FLAG4ab4f5a5b [2020-12-22 10:53:14,937 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 10:53:14,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix027_power.opt.i [2020-12-22 10:53:14,961 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2edb8a4e/e95a5b231a194a44b9778ed5a4d77906/FLAG4ab4f5a5b [2020-12-22 10:53:15,192 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2edb8a4e/e95a5b231a194a44b9778ed5a4d77906 [2020-12-22 10:53:15,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 10:53:15,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 10:53:15,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 10:53:15,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 10:53:15,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 10:53:15,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:53:15" (1/1) ... [2020-12-22 10:53:15,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec2ed9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:15, skipping insertion in model container [2020-12-22 10:53:15,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:53:15" (1/1) ... [2020-12-22 10:53:15,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 10:53:15,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 10:53:15,507 WARN L226 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/mix027_power.opt.i[950,963] [2020-12-22 10:53:15,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 10:53:15,888 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 10:53:15,909 WARN L226 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/mix027_power.opt.i[950,963] [2020-12-22 10:53:16,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 10:53:16,226 INFO L208 MainTranslator]: Completed translation [2020-12-22 10:53:16,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:16 WrapperNode [2020-12-22 10:53:16,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 10:53:16,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 10:53:16,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 10:53:16,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 10:53:16,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:16" (1/1) ... [2020-12-22 10:53:16,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:16" (1/1) ... [2020-12-22 10:53:16,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 10:53:16,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 10:53:16,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 10:53:16,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 10:53:16,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:16" (1/1) ... [2020-12-22 10:53:16,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:16" (1/1) ... [2020-12-22 10:53:16,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:16" (1/1) ... [2020-12-22 10:53:16,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:16" (1/1) ... [2020-12-22 10:53:16,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:16" (1/1) ... [2020-12-22 10:53:16,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:16" (1/1) ... [2020-12-22 10:53:16,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:16" (1/1) ... [2020-12-22 10:53:16,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 10:53:16,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 10:53:16,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 10:53:16,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 10:53:16,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 10:53:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-22 10:53:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-22 10:53:16,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 10:53:16,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-22 10:53:16,575 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-22 10:53:16,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-22 10:53:16,576 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-22 10:53:16,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-22 10:53:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-22 10:53:16,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-22 10:53:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-22 10:53:16,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-22 10:53:16,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 10:53:16,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-22 10:53:16,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 10:53:16,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 10:53:16,583 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-22 10:53:19,531 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 10:53:19,531 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-22 10:53:19,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:53:19 BoogieIcfgContainer [2020-12-22 10:53:19,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 10:53:19,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 10:53:19,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 10:53:19,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 10:53:19,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 10:53:15" (1/3) ... [2020-12-22 10:53:19,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769fad24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:53:19, skipping insertion in model container [2020-12-22 10:53:19,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:16" (2/3) ... [2020-12-22 10:53:19,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769fad24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:53:19, skipping insertion in model container [2020-12-22 10:53:19,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:53:19" (3/3) ... [2020-12-22 10:53:19,547 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_power.opt.i [2020-12-22 10:53:19,556 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-22 10:53:19,557 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 10:53:19,563 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-22 10:53:19,564 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-22 10:53:19,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,636 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,636 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,637 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,637 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,639 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,639 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,640 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,640 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,671 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,671 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,680 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,680 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,685 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,687 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,687 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,688 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,688 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,696 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,698 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,702 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,703 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,704 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,706 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,707 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,714 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,715 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:19,716 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-22 10:53:19,737 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-22 10:53:19,777 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 10:53:19,777 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 10:53:19,778 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 10:53:19,778 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 10:53:19,778 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 10:53:19,778 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 10:53:19,778 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 10:53:19,778 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 10:53:19,799 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-22 10:53:19,801 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 250 flow [2020-12-22 10:53:19,805 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 250 flow [2020-12-22 10:53:19,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2020-12-22 10:53:19,895 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2020-12-22 10:53:19,899 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-22 10:53:19,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-12-22 10:53:19,914 INFO L116 LiptonReduction]: Number of co-enabled transitions 2512 [2020-12-22 10:53:20,467 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:20,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:20,475 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:20,481 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:20,548 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:20,551 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:20,561 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:20,568 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:20,674 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:20,675 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:20,681 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:20,686 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:20,732 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:20,734 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:20,738 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:20,743 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:20,960 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:20,962 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:20,965 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,965 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:20,968 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:20,996 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:20,997 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:20,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:21,000 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:21,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:21,003 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:21,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:21,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-22 10:53:21,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:21,457 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-22 10:53:22,085 WARN L197 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-22 10:53:22,284 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-22 10:53:22,392 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:22,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:22,394 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 10:53:22,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:22,397 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 10:53:22,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:22,399 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 10:53:22,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:22,401 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 10:53:22,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:22,404 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 10:53:22,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:22,405 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 10:53:22,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:22,472 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 10:53:22,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 10:53:22,476 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 10:53:22,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:23,046 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:23,048 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:23,050 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:23,053 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:23,079 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:23,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:23,085 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:23,088 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,089 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:23,340 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:23,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:23,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:23,345 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:23,364 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:23,365 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:23,367 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:23,369 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:23,938 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 10:53:23,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 10:53:23,941 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 10:53:23,941 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:23,985 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:23,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:23,997 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 10:53:23,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:24,000 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 10:53:24,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:24,001 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 10:53:24,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:24,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 10:53:24,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:24,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 10:53:24,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:24,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 10:53:24,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:24,130 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-22 10:53:24,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:24,347 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-22 10:53:24,465 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-22 10:53:24,926 WARN L197 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2020-12-22 10:53:25,143 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-12-22 10:53:25,334 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-22 10:53:25,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:25,662 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:25,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:25,666 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:25,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:25,668 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:25,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:25,669 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:25,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:25,690 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:25,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:25,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:25,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:25,693 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:25,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:25,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:25,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:26,369 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:26,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:26,370 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:26,370 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:26,372 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:26,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:26,374 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:26,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:26,392 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:26,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:26,394 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:26,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:26,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:26,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:26,397 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:26,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:27,208 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-12-22 10:53:27,360 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-12-22 10:53:27,514 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-12-22 10:53:27,680 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-12-22 10:53:27,979 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-12-22 10:53:28,251 WARN L197 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-22 10:53:28,534 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-12-22 10:53:28,775 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-22 10:53:29,382 WARN L197 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 120 [2020-12-22 10:53:29,643 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-22 10:53:30,176 WARN L197 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 120 [2020-12-22 10:53:30,433 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-22 10:53:30,444 INFO L131 LiptonReduction]: Checked pairs total: 7600 [2020-12-22 10:53:30,445 INFO L133 LiptonReduction]: Total number of compositions: 94 [2020-12-22 10:53:30,456 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-12-22 10:53:30,717 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3114 states. [2020-12-22 10:53:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states. [2020-12-22 10:53:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-22 10:53:30,728 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:30,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:30,729 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:30,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:30,736 INFO L82 PathProgramCache]: Analyzing trace with hash -271035690, now seen corresponding path program 1 times [2020-12-22 10:53:30,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:30,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637538950] [2020-12-22 10:53:30,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:53:31,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637538950] [2020-12-22 10:53:31,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:31,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-22 10:53:31,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027889312] [2020-12-22 10:53:31,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 10:53:31,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:31,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 10:53:31,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:53:31,137 INFO L87 Difference]: Start difference. First operand 3114 states. Second operand 3 states. [2020-12-22 10:53:31,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:31,315 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-12-22 10:53:31,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 10:53:31,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-22 10:53:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:31,381 INFO L225 Difference]: With dead ends: 2602 [2020-12-22 10:53:31,381 INFO L226 Difference]: Without dead ends: 2122 [2020-12-22 10:53:31,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:53:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-12-22 10:53:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-12-22 10:53:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-12-22 10:53:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-12-22 10:53:31,628 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 7 [2020-12-22 10:53:31,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:31,629 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-12-22 10:53:31,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 10:53:31,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-12-22 10:53:31,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 10:53:31,633 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:31,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:31,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 10:53:31,634 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:31,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:31,635 INFO L82 PathProgramCache]: Analyzing trace with hash -714309940, now seen corresponding path program 1 times [2020-12-22 10:53:31,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:31,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194004948] [2020-12-22 10:53:31,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:53:31,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194004948] [2020-12-22 10:53:31,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:31,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-22 10:53:31,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952994767] [2020-12-22 10:53:31,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 10:53:31,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:31,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 10:53:31,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:53:31,824 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-12-22 10:53:31,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:31,861 INFO L93 Difference]: Finished difference Result 2062 states and 7802 transitions. [2020-12-22 10:53:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 10:53:31,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-22 10:53:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:31,885 INFO L225 Difference]: With dead ends: 2062 [2020-12-22 10:53:31,885 INFO L226 Difference]: Without dead ends: 2062 [2020-12-22 10:53:31,886 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:53:31,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2020-12-22 10:53:31,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2062. [2020-12-22 10:53:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2020-12-22 10:53:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 7802 transitions. [2020-12-22 10:53:31,992 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 7802 transitions. Word has length 11 [2020-12-22 10:53:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:31,993 INFO L481 AbstractCegarLoop]: Abstraction has 2062 states and 7802 transitions. [2020-12-22 10:53:31,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 10:53:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 7802 transitions. [2020-12-22 10:53:31,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-22 10:53:31,996 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:31,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:31,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 10:53:31,997 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:31,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:31,998 INFO L82 PathProgramCache]: Analyzing trace with hash 674344425, now seen corresponding path program 1 times [2020-12-22 10:53:31,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:31,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392078593] [2020-12-22 10:53:31,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:53:32,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392078593] [2020-12-22 10:53:32,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:32,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-22 10:53:32,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769705384] [2020-12-22 10:53:32,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 10:53:32,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:32,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 10:53:32,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:53:32,087 INFO L87 Difference]: Start difference. First operand 2062 states and 7802 transitions. Second operand 3 states. [2020-12-22 10:53:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:32,122 INFO L93 Difference]: Finished difference Result 2034 states and 7678 transitions. [2020-12-22 10:53:32,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 10:53:32,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-12-22 10:53:32,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:32,141 INFO L225 Difference]: With dead ends: 2034 [2020-12-22 10:53:32,142 INFO L226 Difference]: Without dead ends: 2034 [2020-12-22 10:53:32,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:53:32,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2020-12-22 10:53:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2034. [2020-12-22 10:53:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2020-12-22 10:53:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 7678 transitions. [2020-12-22 10:53:32,311 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 7678 transitions. Word has length 12 [2020-12-22 10:53:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:32,312 INFO L481 AbstractCegarLoop]: Abstraction has 2034 states and 7678 transitions. [2020-12-22 10:53:32,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 10:53:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 7678 transitions. [2020-12-22 10:53:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-22 10:53:32,316 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:32,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:32,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 10:53:32,317 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:32,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:32,318 INFO L82 PathProgramCache]: Analyzing trace with hash -569811795, now seen corresponding path program 1 times [2020-12-22 10:53:32,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:32,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617635894] [2020-12-22 10:53:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:53:32,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617635894] [2020-12-22 10:53:32,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:32,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-22 10:53:32,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177467117] [2020-12-22 10:53:32,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 10:53:32,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:32,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 10:53:32,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:53:32,453 INFO L87 Difference]: Start difference. First operand 2034 states and 7678 transitions. Second operand 3 states. [2020-12-22 10:53:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:32,486 INFO L93 Difference]: Finished difference Result 1922 states and 7210 transitions. [2020-12-22 10:53:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 10:53:32,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-12-22 10:53:32,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:32,506 INFO L225 Difference]: With dead ends: 1922 [2020-12-22 10:53:32,507 INFO L226 Difference]: Without dead ends: 1922 [2020-12-22 10:53:32,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:53:32,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2020-12-22 10:53:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1922. [2020-12-22 10:53:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2020-12-22 10:53:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 7210 transitions. [2020-12-22 10:53:32,608 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 7210 transitions. Word has length 13 [2020-12-22 10:53:32,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:32,609 INFO L481 AbstractCegarLoop]: Abstraction has 1922 states and 7210 transitions. [2020-12-22 10:53:32,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 10:53:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 7210 transitions. [2020-12-22 10:53:32,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-22 10:53:32,612 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:32,612 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:32,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 10:53:32,612 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:32,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:32,613 INFO L82 PathProgramCache]: Analyzing trace with hash -485557665, now seen corresponding path program 1 times [2020-12-22 10:53:32,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:32,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695857178] [2020-12-22 10:53:32,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:53:32,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695857178] [2020-12-22 10:53:32,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:32,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 10:53:32,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372594103] [2020-12-22 10:53:32,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 10:53:32,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:32,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 10:53:32,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 10:53:32,754 INFO L87 Difference]: Start difference. First operand 1922 states and 7210 transitions. Second operand 4 states. [2020-12-22 10:53:32,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:32,837 INFO L93 Difference]: Finished difference Result 1958 states and 6674 transitions. [2020-12-22 10:53:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 10:53:32,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-22 10:53:32,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:32,853 INFO L225 Difference]: With dead ends: 1958 [2020-12-22 10:53:32,853 INFO L226 Difference]: Without dead ends: 1478 [2020-12-22 10:53:32,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:53:32,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-12-22 10:53:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1478. [2020-12-22 10:53:32,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2020-12-22 10:53:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 4990 transitions. [2020-12-22 10:53:32,916 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 4990 transitions. Word has length 14 [2020-12-22 10:53:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:32,916 INFO L481 AbstractCegarLoop]: Abstraction has 1478 states and 4990 transitions. [2020-12-22 10:53:32,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 10:53:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 4990 transitions. [2020-12-22 10:53:32,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 10:53:32,919 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:32,919 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:32,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 10:53:32,920 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:32,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:32,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1963584905, now seen corresponding path program 1 times [2020-12-22 10:53:32,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:32,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046182416] [2020-12-22 10:53:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:53:33,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046182416] [2020-12-22 10:53:33,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:33,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 10:53:33,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878950157] [2020-12-22 10:53:33,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 10:53:33,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:33,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 10:53:33,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:53:33,017 INFO L87 Difference]: Start difference. First operand 1478 states and 4990 transitions. Second operand 3 states. [2020-12-22 10:53:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:33,054 INFO L93 Difference]: Finished difference Result 2054 states and 6722 transitions. [2020-12-22 10:53:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 10:53:33,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-22 10:53:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:33,068 INFO L225 Difference]: With dead ends: 2054 [2020-12-22 10:53:33,068 INFO L226 Difference]: Without dead ends: 1522 [2020-12-22 10:53:33,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:53:33,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2020-12-22 10:53:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1450. [2020-12-22 10:53:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-12-22 10:53:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 4662 transitions. [2020-12-22 10:53:33,134 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 4662 transitions. Word has length 16 [2020-12-22 10:53:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:33,135 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 4662 transitions. [2020-12-22 10:53:33,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 10:53:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 4662 transitions. [2020-12-22 10:53:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 10:53:33,138 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:33,139 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:33,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 10:53:33,139 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:33,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:33,140 INFO L82 PathProgramCache]: Analyzing trace with hash 573938841, now seen corresponding path program 1 times [2020-12-22 10:53:33,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:33,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740739571] [2020-12-22 10:53:33,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:53:33,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740739571] [2020-12-22 10:53:33,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:33,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 10:53:33,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496964190] [2020-12-22 10:53:33,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 10:53:33,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:33,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 10:53:33,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:53:33,328 INFO L87 Difference]: Start difference. First operand 1450 states and 4662 transitions. Second operand 5 states. [2020-12-22 10:53:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:33,424 INFO L93 Difference]: Finished difference Result 1246 states and 3657 transitions. [2020-12-22 10:53:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:53:33,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-22 10:53:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:33,433 INFO L225 Difference]: With dead ends: 1246 [2020-12-22 10:53:33,433 INFO L226 Difference]: Without dead ends: 946 [2020-12-22 10:53:33,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:53:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2020-12-22 10:53:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2020-12-22 10:53:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2020-12-22 10:53:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 2722 transitions. [2020-12-22 10:53:33,470 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 2722 transitions. Word has length 16 [2020-12-22 10:53:33,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:33,470 INFO L481 AbstractCegarLoop]: Abstraction has 946 states and 2722 transitions. [2020-12-22 10:53:33,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 10:53:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 2722 transitions. [2020-12-22 10:53:33,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-22 10:53:33,474 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:33,474 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:33,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 10:53:33,474 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:33,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:33,475 INFO L82 PathProgramCache]: Analyzing trace with hash 169974834, now seen corresponding path program 1 times [2020-12-22 10:53:33,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:33,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610314034] [2020-12-22 10:53:33,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:53:33,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610314034] [2020-12-22 10:53:33,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:33,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:53:33,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786234997] [2020-12-22 10:53:33,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:53:33,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:33,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:53:33,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:53:33,585 INFO L87 Difference]: Start difference. First operand 946 states and 2722 transitions. Second operand 6 states. [2020-12-22 10:53:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:33,742 INFO L93 Difference]: Finished difference Result 826 states and 2339 transitions. [2020-12-22 10:53:33,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 10:53:33,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-22 10:53:33,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:33,749 INFO L225 Difference]: With dead ends: 826 [2020-12-22 10:53:33,750 INFO L226 Difference]: Without dead ends: 727 [2020-12-22 10:53:33,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-22 10:53:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2020-12-22 10:53:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2020-12-22 10:53:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2020-12-22 10:53:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 2087 transitions. [2020-12-22 10:53:33,774 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 2087 transitions. Word has length 19 [2020-12-22 10:53:33,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:33,774 INFO L481 AbstractCegarLoop]: Abstraction has 727 states and 2087 transitions. [2020-12-22 10:53:33,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:53:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 2087 transitions. [2020-12-22 10:53:33,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-22 10:53:33,777 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:33,777 INFO L422 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] [2020-12-22 10:53:33,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 10:53:33,778 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:33,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:33,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1265916717, now seen corresponding path program 1 times [2020-12-22 10:53:33,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:33,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147189517] [2020-12-22 10:53:33,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:53:33,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147189517] [2020-12-22 10:53:33,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:33,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 10:53:33,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477422005] [2020-12-22 10:53:33,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 10:53:33,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:33,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 10:53:33,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 10:53:33,893 INFO L87 Difference]: Start difference. First operand 727 states and 2087 transitions. Second operand 4 states. [2020-12-22 10:53:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:34,012 INFO L93 Difference]: Finished difference Result 1161 states and 3264 transitions. [2020-12-22 10:53:34,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:53:34,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-12-22 10:53:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:34,020 INFO L225 Difference]: With dead ends: 1161 [2020-12-22 10:53:34,020 INFO L226 Difference]: Without dead ends: 901 [2020-12-22 10:53:34,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:53:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2020-12-22 10:53:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 661. [2020-12-22 10:53:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2020-12-22 10:53:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1796 transitions. [2020-12-22 10:53:34,049 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1796 transitions. Word has length 22 [2020-12-22 10:53:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:34,049 INFO L481 AbstractCegarLoop]: Abstraction has 661 states and 1796 transitions. [2020-12-22 10:53:34,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 10:53:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1796 transitions. [2020-12-22 10:53:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-22 10:53:34,052 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:34,052 INFO L422 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] [2020-12-22 10:53:34,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 10:53:34,053 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:34,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:34,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1775261997, now seen corresponding path program 2 times [2020-12-22 10:53:34,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:34,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655768907] [2020-12-22 10:53:34,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:53:34,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655768907] [2020-12-22 10:53:34,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:34,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 10:53:34,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499218239] [2020-12-22 10:53:34,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 10:53:34,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:34,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 10:53:34,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:53:34,177 INFO L87 Difference]: Start difference. First operand 661 states and 1796 transitions. Second operand 5 states. [2020-12-22 10:53:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:34,309 INFO L93 Difference]: Finished difference Result 1090 states and 2925 transitions. [2020-12-22 10:53:34,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 10:53:34,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-12-22 10:53:34,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:34,315 INFO L225 Difference]: With dead ends: 1090 [2020-12-22 10:53:34,315 INFO L226 Difference]: Without dead ends: 836 [2020-12-22 10:53:34,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:53:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-12-22 10:53:34,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 634. [2020-12-22 10:53:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2020-12-22 10:53:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1670 transitions. [2020-12-22 10:53:34,341 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1670 transitions. Word has length 22 [2020-12-22 10:53:34,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:34,341 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 1670 transitions. [2020-12-22 10:53:34,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 10:53:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1670 transitions. [2020-12-22 10:53:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-22 10:53:34,344 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:34,344 INFO L422 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] [2020-12-22 10:53:34,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 10:53:34,344 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:34,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1174911099, now seen corresponding path program 3 times [2020-12-22 10:53:34,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:34,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381830863] [2020-12-22 10:53:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:53:34,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381830863] [2020-12-22 10:53:34,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:34,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 10:53:34,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107707663] [2020-12-22 10:53:34,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 10:53:34,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:34,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 10:53:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:53:34,478 INFO L87 Difference]: Start difference. First operand 634 states and 1670 transitions. Second operand 7 states. [2020-12-22 10:53:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:34,563 INFO L93 Difference]: Finished difference Result 607 states and 1617 transitions. [2020-12-22 10:53:34,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:53:34,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-12-22 10:53:34,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:34,566 INFO L225 Difference]: With dead ends: 607 [2020-12-22 10:53:34,566 INFO L226 Difference]: Without dead ends: 178 [2020-12-22 10:53:34,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-12-22 10:53:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-12-22 10:53:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 160. [2020-12-22 10:53:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-12-22 10:53:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 378 transitions. [2020-12-22 10:53:34,571 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 378 transitions. Word has length 22 [2020-12-22 10:53:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:34,572 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 378 transitions. [2020-12-22 10:53:34,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 10:53:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 378 transitions. [2020-12-22 10:53:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 10:53:34,573 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:34,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:34,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 10:53:34,573 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:34,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:34,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2077919436, now seen corresponding path program 1 times [2020-12-22 10:53:34,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:34,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073155363] [2020-12-22 10:53:34,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:53:34,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073155363] [2020-12-22 10:53:34,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:34,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:53:34,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093818512] [2020-12-22 10:53:34,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 10:53:34,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:34,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 10:53:34,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:53:34,798 INFO L87 Difference]: Start difference. First operand 160 states and 378 transitions. Second operand 7 states. [2020-12-22 10:53:34,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:34,932 INFO L93 Difference]: Finished difference Result 186 states and 432 transitions. [2020-12-22 10:53:34,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:53:34,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-12-22 10:53:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:34,934 INFO L225 Difference]: With dead ends: 186 [2020-12-22 10:53:34,934 INFO L226 Difference]: Without dead ends: 114 [2020-12-22 10:53:34,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-22 10:53:34,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-12-22 10:53:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-12-22 10:53:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-12-22 10:53:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 250 transitions. [2020-12-22 10:53:34,938 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 250 transitions. Word has length 26 [2020-12-22 10:53:34,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:34,939 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 250 transitions. [2020-12-22 10:53:34,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 10:53:34,939 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 250 transitions. [2020-12-22 10:53:34,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 10:53:34,940 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:34,940 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:34,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 10:53:34,940 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:34,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:34,941 INFO L82 PathProgramCache]: Analyzing trace with hash -584526572, now seen corresponding path program 2 times [2020-12-22 10:53:34,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:34,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108483533] [2020-12-22 10:53:34,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 10:53:34,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 10:53:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 10:53:35,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 10:53:35,137 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 10:53:35,137 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 10:53:35,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 10:53:35,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 10:53:35 BasicIcfg [2020-12-22 10:53:35,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 10:53:35,321 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 10:53:35,321 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 10:53:35,321 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 10:53:35,322 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:53:19" (3/4) ... [2020-12-22 10:53:35,324 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 10:53:35,442 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/mix027_power.opt.i-witness.graphml [2020-12-22 10:53:35,442 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 10:53:35,443 INFO L168 Benchmark]: Toolchain (without parser) took 20241.39 ms. Allocated memory was 151.0 MB in the beginning and 362.8 MB in the end (delta: 211.8 MB). Free memory was 124.9 MB in the beginning and 289.9 MB in the end (delta: -165.0 MB). Peak memory consumption was 47.5 MB. Max. memory is 8.0 GB. [2020-12-22 10:53:35,444 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 10:53:35,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1021.45 ms. Allocated memory is still 151.0 MB. Free memory was 124.7 MB in the beginning and 119.5 MB in the end (delta: 5.2 MB). Peak memory consumption was 25.5 MB. Max. memory is 8.0 GB. [2020-12-22 10:53:35,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.21 ms. Allocated memory is still 151.0 MB. Free memory was 119.5 MB in the beginning and 116.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 10:53:35,445 INFO L168 Benchmark]: Boogie Preprocessor took 91.87 ms. Allocated memory is still 151.0 MB. Free memory was 116.9 MB in the beginning and 114.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 10:53:35,445 INFO L168 Benchmark]: RCFGBuilder took 3089.69 ms. Allocated memory was 151.0 MB in the beginning and 209.7 MB in the end (delta: 58.7 MB). Free memory was 114.8 MB in the beginning and 135.5 MB in the end (delta: -20.7 MB). Peak memory consumption was 73.7 MB. Max. memory is 8.0 GB. [2020-12-22 10:53:35,446 INFO L168 Benchmark]: TraceAbstraction took 15783.98 ms. Allocated memory was 209.7 MB in the beginning and 362.8 MB in the end (delta: 153.1 MB). Free memory was 135.0 MB in the beginning and 311.9 MB in the end (delta: -177.0 MB). Peak memory consumption was 175.9 MB. Max. memory is 8.0 GB. [2020-12-22 10:53:35,446 INFO L168 Benchmark]: Witness Printer took 121.33 ms. Allocated memory is still 362.8 MB. Free memory was 311.9 MB in the beginning and 289.9 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2020-12-22 10:53:35,448 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.22 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1021.45 ms. Allocated memory is still 151.0 MB. Free memory was 124.7 MB in the beginning and 119.5 MB in the end (delta: 5.2 MB). Peak memory consumption was 25.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 120.21 ms. Allocated memory is still 151.0 MB. Free memory was 119.5 MB in the beginning and 116.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 91.87 ms. Allocated memory is still 151.0 MB. Free memory was 116.9 MB in the beginning and 114.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 3089.69 ms. Allocated memory was 151.0 MB in the beginning and 209.7 MB in the end (delta: 58.7 MB). Free memory was 114.8 MB in the beginning and 135.5 MB in the end (delta: -20.7 MB). Peak memory consumption was 73.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15783.98 ms. Allocated memory was 209.7 MB in the beginning and 362.8 MB in the end (delta: 153.1 MB). Free memory was 135.0 MB in the beginning and 311.9 MB in the end (delta: -177.0 MB). Peak memory consumption was 175.9 MB. Max. memory is 8.0 GB. * Witness Printer took 121.33 ms. Allocated memory is still 362.8 MB. Free memory was 311.9 MB in the beginning and 289.9 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1611 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 53 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 165 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.6s, 126 PlacesBefore, 45 PlacesAfterwards, 115 TransitionsBefore, 33 TransitionsAfterwards, 2512 CoEnabledTransitionPairs, 8 FixpointIterations, 40 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 7600 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L854] 0 pthread_t t717; [L855] FCALL, FORK 0 pthread_create(&t717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] 0 pthread_t t718; [L857] FCALL, FORK 0 pthread_create(&t718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] 0 pthread_t t719; [L859] FCALL, FORK 0 pthread_create(&t719, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t720; [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L803] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L861] FCALL, FORK 0 pthread_create(&t720, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L753] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L773] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L774] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L775] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L776] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L777] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L778] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = y [L780] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L874] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.3s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.9s, HoareTripleCheckerStatistics: 379 SDtfs, 534 SDslu, 571 SDs, 0 SdLazy, 184 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3114occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 532 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 18998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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! Received shutdown request...