/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-b09bf87
[2020-10-16 13:38:40,474 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-10-16 13:38:40,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 13:38:40,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 13:38:40,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 13:38:40,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 13:38:40,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 13:38:40,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 13:38:40,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 13:38:40,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 13:38:40,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 13:38:40,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 13:38:40,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 13:38:40,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 13:38:40,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 13:38:40,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 13:38:40,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 13:38:40,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 13:38:40,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 13:38:40,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 13:38:40,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 13:38:40,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 13:38:40,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 13:38:40,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 13:38:40,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 13:38:40,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 13:38:40,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 13:38:40,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 13:38:40,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 13:38:40,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 13:38:40,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 13:38:40,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 13:38:40,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 13:38:40,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 13:38:40,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 13:38:40,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 13:38:40,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 13:38:40,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 13:38:40,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 13:38:40,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 13:38:40,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 13:38:40,565 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf
[2020-10-16 13:38:40,588 INFO L113 SettingsManager]: Loading preferences was successful
[2020-10-16 13:38:40,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 13:38:40,590 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 13:38:40,590 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-10-16 13:38:40,590 INFO L138 SettingsManager]: * Use SBE=true
[2020-10-16 13:38:40,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 13:38:40,591 INFO L138 SettingsManager]: * sizeof long=4
[2020-10-16 13:38:40,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-10-16 13:38:40,591 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-10-16 13:38:40,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-10-16 13:38:40,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 13:38:40,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 13:38:40,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 13:38:40,592 INFO L138 SettingsManager]: * sizeof long double=12
[2020-10-16 13:38:40,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-10-16 13:38:40,592 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-10-16 13:38:40,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-10-16 13:38:40,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 13:38:40,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-10-16 13:38:40,593 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-10-16 13:38:40,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-10-16 13:38:40,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 13:38:40,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 13:38:40,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-10-16 13:38:40,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 13:38:40,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-10-16 13:38:40,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 13:38:40,595 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true
[2020-10-16 13:38:40,595 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-10-16 13:38:40,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 13:38:40,595 INFO L138 SettingsManager]: * Interpolant automaton=MCR
[2020-10-16 13:38:40,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 13:38:40,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 13:38:40,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 13:38:40,889 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-10-16 13:38:40,889 INFO L275 PluginConnector]: CDTParser initialized
[2020-10-16 13:38:40,890 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.opt.i
[2020-10-16 13:38:40,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3779bbbe5/cde8d5a8fd784431bb86cef2504c88ca/FLAG7906981bc
[2020-10-16 13:38:41,432 INFO L306 CDTParser]: Found 1 translation units.
[2020-10-16 13:38:41,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe013_pso.opt.i
[2020-10-16 13:38:41,448 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3779bbbe5/cde8d5a8fd784431bb86cef2504c88ca/FLAG7906981bc
[2020-10-16 13:38:41,758 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3779bbbe5/cde8d5a8fd784431bb86cef2504c88ca
[2020-10-16 13:38:41,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 13:38:41,768 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 13:38:41,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 13:38:41,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 13:38:41,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 13:38:41,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:38:41" (1/1) ...
[2020-10-16 13:38:41,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a57d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:41, skipping insertion in model container
[2020-10-16 13:38:41,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:38:41" (1/1) ...
[2020-10-16 13:38:41,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-10-16 13:38:41,852 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-10-16 13:38:42,409 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:38:42,425 INFO L203 MainTranslator]: Completed pre-run
[2020-10-16 13:38:42,535 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:38:42,626 INFO L208 MainTranslator]: Completed translation
[2020-10-16 13:38:42,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:42 WrapperNode
[2020-10-16 13:38:42,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 13:38:42,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 13:38:42,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 13:38:42,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 13:38:42,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:42" (1/1) ...
[2020-10-16 13:38:42,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:42" (1/1) ...
[2020-10-16 13:38:42,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 13:38:42,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 13:38:42,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 13:38:42,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 13:38:42,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:42" (1/1) ...
[2020-10-16 13:38:42,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:42" (1/1) ...
[2020-10-16 13:38:42,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:42" (1/1) ...
[2020-10-16 13:38:42,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:42" (1/1) ...
[2020-10-16 13:38:42,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:42" (1/1) ...
[2020-10-16 13:38:42,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:42" (1/1) ...
[2020-10-16 13:38:42,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:42" (1/1) ...
[2020-10-16 13:38:42,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 13:38:42,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 13:38:42,736 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 13:38:42,737 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-10-16 13:38:42,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:42" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/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-10-16 13:38:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 13:38:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 13:38:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 13:38:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 13:38:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 13:38:42,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 13:38:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 13:38:42,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 13:38:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 13:38:42,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 13:38:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 13:38:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 13:38:42,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 13:38:42,811 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 13:38:44,814 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 13:38:44,815 INFO L298 CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 13:38:44,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:38:44 BoogieIcfgContainer
[2020-10-16 13:38:44,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 13:38:44,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 13:38:44,819 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 13:38:44,823 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-10-16 13:38:44,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:38:41" (1/3) ...
[2020-10-16 13:38:44,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d42a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:38:44, skipping insertion in model container
[2020-10-16 13:38:44,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:42" (2/3) ...
[2020-10-16 13:38:44,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d42a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:38:44, skipping insertion in model container
[2020-10-16 13:38:44,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:38:44" (3/3) ...
[2020-10-16 13:38:44,828 INFO L111 eAbstractionObserver]: Analyzing ICFG safe013_pso.opt.i
[2020-10-16 13:38:44,839 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 13:38:44,840 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-10-16 13:38:44,848 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 13:38:44,849 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 13:38:44,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,879 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,879 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,890 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,890 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,890 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,890 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,893 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,893 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,900 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,901 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,908 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,909 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,915 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,915 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,915 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:44,918 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 13:38:44,932 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 13:38:44,953 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2020-10-16 13:38:44,953 INFO L378 AbstractCegarLoop]: Hoare is true
[2020-10-16 13:38:44,954 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-10-16 13:38:44,954 INFO L380 AbstractCegarLoop]: Backedges is MCR
[2020-10-16 13:38:44,954 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 13:38:44,954 INFO L382 AbstractCegarLoop]: Difference is false
[2020-10-16 13:38:44,954 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 13:38:44,954 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 13:38:44,968 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-10-16 13:38:44,969 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow
[2020-10-16 13:38:44,972 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow
[2020-10-16 13:38:44,974 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow
[2020-10-16 13:38:45,021 INFO L129 PetriNetUnfolder]: 2/89 cut-off events.
[2020-10-16 13:38:45,021 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 13:38:45,026 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place.
[2020-10-16 13:38:45,030 INFO L117 LiptonReduction]: Number of co-enabled transitions 1544
[2020-10-16 13:38:45,369 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 13:38:47,341 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83
[2020-10-16 13:38:47,479 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2020-10-16 13:38:47,592 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2020-10-16 13:38:47,696 INFO L132 LiptonReduction]: Checked pairs total: 4193
[2020-10-16 13:38:47,696 INFO L134 LiptonReduction]: Total number of compositions: 78
[2020-10-16 13:38:47,704 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow
[2020-10-16 13:38:47,764 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 658 states.
[2020-10-16 13:38:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states.
[2020-10-16 13:38:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-16 13:38:47,793 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:47,794 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-16 13:38:47,794 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:38:47,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:47,803 INFO L82 PathProgramCache]: Analyzing trace with hash 913711493, now seen corresponding path program 1 times
[2020-10-16 13:38:47,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:47,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904347874]
[2020-10-16 13:38:47,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:38:48,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904347874]
[2020-10-16 13:38:48,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:48,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:38:48,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1256640305]
[2020-10-16 13:38:48,030 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:48,033 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:48,046 INFO L258 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions.
[2020-10-16 13:38:48,047 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:48,050 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:38:48,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:38:48,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:48,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:38:48,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:38:48,069 INFO L87 Difference]: Start difference. First operand 658 states. Second operand 3 states.
[2020-10-16 13:38:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:48,137 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions.
[2020-10-16 13:38:48,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 13:38:48,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-16 13:38:48,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:48,168 INFO L225 Difference]: With dead ends: 550
[2020-10-16 13:38:48,169 INFO L226 Difference]: Without dead ends: 450
[2020-10-16 13:38:48,170 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-10-16 13:38:48,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states.
[2020-10-16 13:38:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450.
[2020-10-16 13:38:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states.
[2020-10-16 13:38:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions.
[2020-10-16 13:38:48,273 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 5
[2020-10-16 13:38:48,273 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:48,273 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions.
[2020-10-16 13:38:48,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:38:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions.
[2020-10-16 13:38:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 13:38:48,275 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:48,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:38:48,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 13:38:48,276 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:38:48,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash -421820418, now seen corresponding path program 1 times
[2020-10-16 13:38:48,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:48,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328806242]
[2020-10-16 13:38:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:38:48,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328806242]
[2020-10-16 13:38:48,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:48,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:38:48,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1355652208]
[2020-10-16 13:38:48,357 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:48,358 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:48,359 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions.
[2020-10-16 13:38:48,359 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:48,360 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:38:48,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:38:48,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:48,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:38:48,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:38:48,362 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states.
[2020-10-16 13:38:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:48,379 INFO L93 Difference]: Finished difference Result 430 states and 1287 transitions.
[2020-10-16 13:38:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 13:38:48,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 13:38:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:48,384 INFO L225 Difference]: With dead ends: 430
[2020-10-16 13:38:48,384 INFO L226 Difference]: Without dead ends: 430
[2020-10-16 13:38:48,385 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-10-16 13:38:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states.
[2020-10-16 13:38:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430.
[2020-10-16 13:38:48,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2020-10-16 13:38:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1287 transitions.
[2020-10-16 13:38:48,413 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1287 transitions. Word has length 9
[2020-10-16 13:38:48,414 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:48,414 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 1287 transitions.
[2020-10-16 13:38:48,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:38:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1287 transitions.
[2020-10-16 13:38:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 13:38:48,416 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:48,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:38:48,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 13:38:48,417 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:38:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash -191532040, now seen corresponding path program 1 times
[2020-10-16 13:38:48,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:48,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220477497]
[2020-10-16 13:38:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:38:48,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220477497]
[2020-10-16 13:38:48,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:48,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:38:48,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1224307125]
[2020-10-16 13:38:48,542 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:48,543 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:48,546 INFO L258 McrAutomatonBuilder]: Finished intersection with 13 states and 14 transitions.
[2020-10-16 13:38:48,546 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:48,585 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:38:48,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:38:48,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:48,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:38:48,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:38:48,587 INFO L87 Difference]: Start difference. First operand 430 states and 1287 transitions. Second operand 4 states.
[2020-10-16 13:38:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:48,619 INFO L93 Difference]: Finished difference Result 542 states and 1583 transitions.
[2020-10-16 13:38:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 13:38:48,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2020-10-16 13:38:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:48,622 INFO L225 Difference]: With dead ends: 542
[2020-10-16 13:38:48,623 INFO L226 Difference]: Without dead ends: 302
[2020-10-16 13:38:48,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-16 13:38:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states.
[2020-10-16 13:38:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302.
[2020-10-16 13:38:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states.
[2020-10-16 13:38:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 847 transitions.
[2020-10-16 13:38:48,654 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 847 transitions. Word has length 10
[2020-10-16 13:38:48,654 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:48,655 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 847 transitions.
[2020-10-16 13:38:48,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:38:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 847 transitions.
[2020-10-16 13:38:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 13:38:48,656 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:48,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:38:48,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 13:38:48,658 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:38:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:48,659 INFO L82 PathProgramCache]: Analyzing trace with hash 621784461, now seen corresponding path program 1 times
[2020-10-16 13:38:48,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:48,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302529280]
[2020-10-16 13:38:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:38:48,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302529280]
[2020-10-16 13:38:48,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:48,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:38:48,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418041613]
[2020-10-16 13:38:48,768 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:48,770 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:48,772 INFO L258 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions.
[2020-10-16 13:38:48,772 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:48,772 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:38:48,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:38:48,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:48,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:38:48,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:38:48,774 INFO L87 Difference]: Start difference. First operand 302 states and 847 transitions. Second operand 3 states.
[2020-10-16 13:38:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:48,787 INFO L93 Difference]: Finished difference Result 299 states and 836 transitions.
[2020-10-16 13:38:48,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 13:38:48,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-16 13:38:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:48,790 INFO L225 Difference]: With dead ends: 299
[2020-10-16 13:38:48,790 INFO L226 Difference]: Without dead ends: 299
[2020-10-16 13:38:48,790 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-10-16 13:38:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states.
[2020-10-16 13:38:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299.
[2020-10-16 13:38:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states.
[2020-10-16 13:38:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 836 transitions.
[2020-10-16 13:38:48,801 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 836 transitions. Word has length 12
[2020-10-16 13:38:48,801 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:48,801 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 836 transitions.
[2020-10-16 13:38:48,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:38:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 836 transitions.
[2020-10-16 13:38:48,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 13:38:48,803 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:48,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:38:48,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 13:38:48,804 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:38:48,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:48,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1298541099, now seen corresponding path program 1 times
[2020-10-16 13:38:48,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:48,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846648933]
[2020-10-16 13:38:48,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:38:48,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846648933]
[2020-10-16 13:38:48,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:48,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 13:38:48,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459021709]
[2020-10-16 13:38:48,873 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:48,875 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:48,879 INFO L258 McrAutomatonBuilder]: Finished intersection with 23 states and 31 transitions.
[2020-10-16 13:38:48,879 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:48,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:49,000 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:38:49,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:38:49,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:49,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:38:49,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:38:49,001 INFO L87 Difference]: Start difference. First operand 299 states and 836 transitions. Second operand 4 states.
[2020-10-16 13:38:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:49,038 INFO L93 Difference]: Finished difference Result 291 states and 721 transitions.
[2020-10-16 13:38:49,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-10-16 13:38:49,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-16 13:38:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:49,040 INFO L225 Difference]: With dead ends: 291
[2020-10-16 13:38:49,040 INFO L226 Difference]: Without dead ends: 223
[2020-10-16 13:38:49,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 13:38:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states.
[2020-10-16 13:38:49,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223.
[2020-10-16 13:38:49,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states.
[2020-10-16 13:38:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 544 transitions.
[2020-10-16 13:38:49,048 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 544 transitions. Word has length 13
[2020-10-16 13:38:49,048 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:49,048 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 544 transitions.
[2020-10-16 13:38:49,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:38:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 544 transitions.
[2020-10-16 13:38:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 13:38:49,050 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:49,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:38:49,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 13:38:49,050 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:38:49,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:49,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1613655544, now seen corresponding path program 1 times
[2020-10-16 13:38:49,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:49,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133134113]
[2020-10-16 13:38:49,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:38:49,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133134113]
[2020-10-16 13:38:49,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:49,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 13:38:49,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1860839603]
[2020-10-16 13:38:49,180 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:49,184 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:49,192 INFO L258 McrAutomatonBuilder]: Finished intersection with 28 states and 39 transitions.
[2020-10-16 13:38:49,192 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:49,313 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6965#(<= ~__unbuffered_cnt~0 0)]
[2020-10-16 13:38:49,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 13:38:49,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:49,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 13:38:49,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 13:38:49,314 INFO L87 Difference]: Start difference. First operand 223 states and 544 transitions. Second operand 6 states.
[2020-10-16 13:38:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:49,362 INFO L93 Difference]: Finished difference Result 185 states and 411 transitions.
[2020-10-16 13:38:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-10-16 13:38:49,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2020-10-16 13:38:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:49,363 INFO L225 Difference]: With dead ends: 185
[2020-10-16 13:38:49,364 INFO L226 Difference]: Without dead ends: 147
[2020-10-16 13:38:49,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 13:38:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states.
[2020-10-16 13:38:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147.
[2020-10-16 13:38:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2020-10-16 13:38:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 320 transitions.
[2020-10-16 13:38:49,369 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 320 transitions. Word has length 15
[2020-10-16 13:38:49,369 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:49,369 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 320 transitions.
[2020-10-16 13:38:49,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 13:38:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 320 transitions.
[2020-10-16 13:38:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 13:38:49,370 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:49,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:38:49,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 13:38:49,371 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:38:49,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:49,371 INFO L82 PathProgramCache]: Analyzing trace with hash 2041535800, now seen corresponding path program 1 times
[2020-10-16 13:38:49,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:49,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510181120]
[2020-10-16 13:38:49,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:38:49,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510181120]
[2020-10-16 13:38:49,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:49,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 13:38:49,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1158930184]
[2020-10-16 13:38:49,486 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:49,490 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:49,505 INFO L258 McrAutomatonBuilder]: Finished intersection with 53 states and 94 transitions.
[2020-10-16 13:38:49,505 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:49,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:49,745 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7453#(<= ~__unbuffered_cnt~0 0)]
[2020-10-16 13:38:49,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 13:38:49,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:49,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 13:38:49,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 13:38:49,747 INFO L87 Difference]: Start difference. First operand 147 states and 320 transitions. Second operand 7 states.
[2020-10-16 13:38:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:49,796 INFO L93 Difference]: Finished difference Result 131 states and 286 transitions.
[2020-10-16 13:38:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-10-16 13:38:49,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-16 13:38:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:49,798 INFO L225 Difference]: With dead ends: 131
[2020-10-16 13:38:49,798 INFO L226 Difference]: Without dead ends: 121
[2020-10-16 13:38:49,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-16 13:38:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2020-10-16 13:38:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121.
[2020-10-16 13:38:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states.
[2020-10-16 13:38:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 268 transitions.
[2020-10-16 13:38:49,803 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 268 transitions. Word has length 17
[2020-10-16 13:38:49,803 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:49,803 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 268 transitions.
[2020-10-16 13:38:49,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 13:38:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 268 transitions.
[2020-10-16 13:38:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 13:38:49,804 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:49,804 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]
[2020-10-16 13:38:49,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 13:38:49,804 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:38:49,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:49,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1929467529, now seen corresponding path program 1 times
[2020-10-16 13:38:49,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:49,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077564489]
[2020-10-16 13:38:49,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:38:49,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077564489]
[2020-10-16 13:38:49,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:49,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:38:49,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [550182319]
[2020-10-16 13:38:49,860 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:49,864 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:49,886 INFO L258 McrAutomatonBuilder]: Finished intersection with 55 states and 96 transitions.
[2020-10-16 13:38:49,886 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:49,911 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:38:49,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:38:49,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:49,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:38:49,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:38:49,912 INFO L87 Difference]: Start difference. First operand 121 states and 268 transitions. Second operand 3 states.
[2020-10-16 13:38:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:49,920 INFO L93 Difference]: Finished difference Result 150 states and 324 transitions.
[2020-10-16 13:38:49,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 13:38:49,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20
[2020-10-16 13:38:49,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:49,922 INFO L225 Difference]: With dead ends: 150
[2020-10-16 13:38:49,922 INFO L226 Difference]: Without dead ends: 61
[2020-10-16 13:38:49,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-10-16 13:38:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2020-10-16 13:38:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61.
[2020-10-16 13:38:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2020-10-16 13:38:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions.
[2020-10-16 13:38:49,925 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 112 transitions. Word has length 20
[2020-10-16 13:38:49,925 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:49,925 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 112 transitions.
[2020-10-16 13:38:49,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:38:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions.
[2020-10-16 13:38:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 13:38:49,926 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:49,926 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]
[2020-10-16 13:38:49,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 13:38:49,927 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:38:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:49,927 INFO L82 PathProgramCache]: Analyzing trace with hash -439366969, now seen corresponding path program 2 times
[2020-10-16 13:38:49,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:49,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346862121]
[2020-10-16 13:38:49,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:38:50,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346862121]
[2020-10-16 13:38:50,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:50,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 13:38:50,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [398206525]
[2020-10-16 13:38:50,142 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:50,146 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:50,163 INFO L258 McrAutomatonBuilder]: Finished intersection with 49 states and 82 transitions.
[2020-10-16 13:38:50,164 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:50,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,214 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:50,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,216 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:50,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:38:50,243 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,243 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:38:50,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,320 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term
[2020-10-16 13:38:50,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,340 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,348 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:38:50,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,351 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:50,351 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,353 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:50,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,359 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,368 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,380 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,393 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:38:50,400 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,403 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,429 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,437 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,452 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,460 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,472 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:38:50,483 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:38:50,485 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:38:50,491 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,494 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,511 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,525 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,548 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,549 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,553 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:38:50,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,555 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:50,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,556 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:50,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,559 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,571 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,578 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,590 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,601 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,608 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,629 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:38:50,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,637 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,638 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,660 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,661 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,672 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,778 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,784 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:38:50,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,786 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:50,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,787 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:50,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,788 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,799 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,805 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,814 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,846 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,856 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,862 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,871 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,945 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,946 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,952 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,961 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:50,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:50,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:50,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:51,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:51,016 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:51,018 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:51,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:51,019 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:51,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:51,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:51,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:51,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:51,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:51,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:51,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:51,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:51,034 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:51,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:51,047 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:51,048 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:51,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:51,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:51,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:51,069 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:51,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:51,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:51,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:51,085 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term
[2020-10-16 13:38:51,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:51,103 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8111#(and (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd3~0) (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (not (= (mod ~x$w_buff0_used~0 256) 0)))]
[2020-10-16 13:38:51,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 13:38:51,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:51,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 13:38:51,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2020-10-16 13:38:51,105 INFO L87 Difference]: Start difference. First operand 61 states and 112 transitions. Second operand 8 states.
[2020-10-16 13:38:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:51,271 INFO L93 Difference]: Finished difference Result 75 states and 134 transitions.
[2020-10-16 13:38:51,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-10-16 13:38:51,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20
[2020-10-16 13:38:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:51,273 INFO L225 Difference]: With dead ends: 75
[2020-10-16 13:38:51,273 INFO L226 Difference]: Without dead ends: 41
[2020-10-16 13:38:51,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2020-10-16 13:38:51,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2020-10-16 13:38:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2020-10-16 13:38:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2020-10-16 13:38:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions.
[2020-10-16 13:38:51,277 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 20
[2020-10-16 13:38:51,277 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:51,277 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions.
[2020-10-16 13:38:51,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 13:38:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions.
[2020-10-16 13:38:51,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 13:38:51,279 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:51,279 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]
[2020-10-16 13:38:51,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 13:38:51,279 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:38:51,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:51,280 INFO L82 PathProgramCache]: Analyzing trace with hash -483881779, now seen corresponding path program 3 times
[2020-10-16 13:38:51,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:51,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439456086]
[2020-10-16 13:38:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:38:51,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:38:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:38:51,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:38:51,554 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 13:38:51,555 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 13:38:51,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 13:38:51,556 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 13:38:51,590 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L829-->L836: Formula: (let ((.cse7 (= (mod ~x$r_buff1_thd0~0_In1075580294 256) 0)) (.cse6 (= (mod ~x$w_buff1_used~0_In1075580294 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In1075580294 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In1075580294 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and .cse0 (= ~x$w_buff0_used~0_Out1075580294 0) .cse1) (and (= ~x$w_buff0_used~0_In1075580294 ~x$w_buff0_used~0_Out1075580294) .cse2)) (or (and (or (and .cse3 (= ~x~0_In1075580294 ~x~0_Out1075580294)) (and (= ~x$w_buff1~0_In1075580294 ~x~0_Out1075580294) .cse4 .cse5)) .cse2) (and .cse0 (= ~x$w_buff0~0_In1075580294 ~x~0_Out1075580294) .cse1)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1075580294 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1075580294 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1075580294|) (= ~x$r_buff0_thd0~0_Out1075580294 ~x$r_buff0_thd0~0_In1075580294) (or (and (= ~x$w_buff1_used~0_In1075580294 ~x$w_buff1_used~0_Out1075580294) .cse3) (and .cse4 .cse5 (= ~x$w_buff1_used~0_Out1075580294 0))) (= ~x$r_buff1_thd0~0_Out1075580294 ~x$r_buff1_thd0~0_In1075580294)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1075580294, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1075580294, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1075580294|, ~x$w_buff1~0=~x$w_buff1~0_In1075580294, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1075580294, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1075580294, ~x~0=~x~0_In1075580294, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1075580294} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1075580294, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1075580294, ~x$w_buff1~0=~x$w_buff1~0_In1075580294, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1075580294, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1075580294, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1075580294|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1075580294|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1075580294|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1075580294, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1075580294|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1075580294|, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1075580294|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1075580294|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1075580294, ~x~0=~x~0_Out1075580294} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ~x~0, ULTIMATE.start_main_#t~ite45, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite44] because there is no mapped edge
[2020-10-16 13:38:51,607 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,607 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,608 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,608 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,608 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,609 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,610 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,610 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,611 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,611 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,611 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,612 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,612 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,612 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,614 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,614 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,614 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,614 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,615 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,615 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,616 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,616 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,616 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,617 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,617 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,617 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,617 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,618 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,619 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,619 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,620 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,620 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,626 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,627 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,627 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,628 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,628 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,628 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,628 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,629 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,629 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:38:51,629 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:51,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:38:51 BasicIcfg
[2020-10-16 13:38:51,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 13:38:51,749 INFO L168 Benchmark]: Toolchain (without parser) took 9979.90 ms. Allocated memory was 141.6 MB in the beginning and 362.8 MB in the end (delta: 221.2 MB). Free memory was 103.2 MB in the beginning and 220.0 MB in the end (delta: -116.7 MB). Peak memory consumption was 104.5 MB. Max. memory is 7.1 GB.
[2020-10-16 13:38:51,750 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-10-16 13:38:51,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 858.08 ms. Allocated memory was 141.6 MB in the beginning and 204.5 MB in the end (delta: 62.9 MB). Free memory was 103.0 MB in the beginning and 156.4 MB in the end (delta: -53.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB.
[2020-10-16 13:38:51,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.43 ms. Allocated memory is still 204.5 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 13:38:51,756 INFO L168 Benchmark]: Boogie Preprocessor took 38.76 ms. Allocated memory is still 204.5 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 13:38:51,757 INFO L168 Benchmark]: RCFGBuilder took 2081.46 ms. Allocated memory was 204.5 MB in the beginning and 244.8 MB in the end (delta: 40.4 MB). Free memory was 151.1 MB in the beginning and 180.5 MB in the end (delta: -29.3 MB). Peak memory consumption was 95.4 MB. Max. memory is 7.1 GB.
[2020-10-16 13:38:51,761 INFO L168 Benchmark]: TraceAbstraction took 6926.35 ms. Allocated memory was 244.8 MB in the beginning and 362.8 MB in the end (delta: 118.0 MB). Free memory was 180.5 MB in the beginning and 220.0 MB in the end (delta: -39.5 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB.
[2020-10-16 13:38:51,769 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.17 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 858.08 ms. Allocated memory was 141.6 MB in the beginning and 204.5 MB in the end (delta: 62.9 MB). Free memory was 103.0 MB in the beginning and 156.4 MB in the end (delta: -53.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 69.43 ms. Allocated memory is still 204.5 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 38.76 ms. Allocated memory is still 204.5 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 2081.46 ms. Allocated memory was 204.5 MB in the beginning and 244.8 MB in the end (delta: 40.4 MB). Free memory was 151.1 MB in the beginning and 180.5 MB in the end (delta: -29.3 MB). Peak memory consumption was 95.4 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 6926.35 ms. Allocated memory was 244.8 MB in the beginning and 362.8 MB in the end (delta: 118.0 MB). Free memory was 180.5 MB in the beginning and 220.0 MB in the end (delta: -39.5 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
822 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 79 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.7s, 100 PlacesBefore, 35 PlacesAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1544 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 4193 MoverChecksTotal
- CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable
a call of __VERIFIER_error() is reachable
We found a FailurePath:
[L699] 0 int __unbuffered_cnt = 0;
[L701] 0 int __unbuffered_p0_EAX = 0;
[L703] 0 int __unbuffered_p2_EAX = 0;
[L704] 0 _Bool main$tmp_guard0;
[L705] 0 _Bool main$tmp_guard1;
[L707] 0 int x = 0;
[L708] 0 _Bool x$flush_delayed;
[L709] 0 int x$mem_tmp;
[L710] 0 _Bool x$r_buff0_thd0;
[L711] 0 _Bool x$r_buff0_thd1;
[L712] 0 _Bool x$r_buff0_thd2;
[L713] 0 _Bool x$r_buff0_thd3;
[L714] 0 _Bool x$r_buff1_thd0;
[L715] 0 _Bool x$r_buff1_thd1;
[L716] 0 _Bool x$r_buff1_thd2;
[L717] 0 _Bool x$r_buff1_thd3;
[L718] 0 _Bool x$read_delayed;
[L719] 0 int *x$read_delayed_var;
[L720] 0 int x$w_buff0;
[L721] 0 _Bool x$w_buff0_used;
[L722] 0 int x$w_buff1;
[L723] 0 _Bool x$w_buff1_used;
[L725] 0 int y = 0;
[L727] 0 int z = 0;
[L728] 0 _Bool weak$$choice0;
[L729] 0 _Bool weak$$choice2;
[L820] 0 pthread_t t2082;
[L821] FCALL, FORK 0 pthread_create(&t2082, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L822] 0 pthread_t t2083;
[L823] FCALL, FORK 0 pthread_create(&t2083, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L824] 0 pthread_t t2084;
[L825] FCALL, FORK 0 pthread_create(&t2084, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L763] 2 x$w_buff1 = x$w_buff0
[L764] 2 x$w_buff0 = 1
[L765] 2 x$w_buff1_used = x$w_buff0_used
[L766] 2 x$w_buff0_used = (_Bool)1
[L8] COND FALSE 2 !(!expression)
[L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L772] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L775] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L792] 3 __unbuffered_p2_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L795] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L733] 1 z = 2
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L798] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L807] 3 return 0;
[L738] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L739] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L740] 1 x$flush_delayed = weak$$choice2
[L741] 1 x$mem_tmp = x
[L742] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1
[L742] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L742] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L743] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L743] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L744] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)
[L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1
[L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)
[L744] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L744] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L745] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L745] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L746] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L746] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L747] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L747] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L748] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L748] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L748] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L748] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L749] 1 __unbuffered_p0_EAX = x
[L750] EXPR 1 x$flush_delayed ? x$mem_tmp : x
[L750] 1 x = x$flush_delayed ? x$mem_tmp : x
[L751] 1 x$flush_delayed = (_Bool)0
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L758] 1 return 0;
[L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L787] 2 return 0;
[L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L838] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1)
[L8] COND TRUE 0 !expression
[L8] 0 __VERIFIER_error()
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.6s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 197 SDtfs, 184 SDslu, 337 SDs, 0 SdLazy, 146 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 97 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 6552 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...