/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:19:03,843 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:19:03,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:19:03,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:19:03,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:19:03,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:19:03,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:19:03,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:19:03,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:19:03,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:19:03,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:19:03,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:19:03,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:19:03,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:19:03,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:19:03,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:19:03,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:19:03,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:19:03,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:19:03,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:19:03,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:19:03,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:19:03,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:19:03,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:19:03,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:19:03,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:19:03,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:19:03,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:19:03,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:19:03,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:19:03,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:19:03,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:19:03,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:19:03,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:19:03,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:19:03,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:19:03,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:19:03,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:19:03,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:19:03,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:19:03,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:19:03,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-16 11:19:03,963 INFO L113 SettingsManager]: Loading preferences was successful
[2020-10-16 11:19:03,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:19:03,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:19:03,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-10-16 11:19:03,965 INFO L138 SettingsManager]: * Use SBE=true
[2020-10-16 11:19:03,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:19:03,966 INFO L138 SettingsManager]: * sizeof long=4
[2020-10-16 11:19:03,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-10-16 11:19:03,966 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-10-16 11:19:03,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-10-16 11:19:03,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:19:03,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:19:03,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:19:03,967 INFO L138 SettingsManager]: * sizeof long double=12
[2020-10-16 11:19:03,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-10-16 11:19:03,967 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-10-16 11:19:03,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:19:03,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:19:03,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-10-16 11:19:03,968 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-10-16 11:19:03,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-10-16 11:19:03,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:19:03,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:19:03,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 11:19:03,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:19:03,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-10-16 11:19:03,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:19:03,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 11:19:03,970 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2020-10-16 11:19:03,970 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 11:19:04,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 11:19:04,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 11:19:04,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 11:19:04,308 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-10-16 11:19:04,308 INFO L275 PluginConnector]: CDTParser initialized
[2020-10-16 11:19:04,309 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.opt.i
[2020-10-16 11:19:04,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/72c8aab15/3b7e757aa7274833a0f9e08b864696cd/FLAG442583015
[2020-10-16 11:19:04,964 INFO L306 CDTParser]: Found 1 translation units.
[2020-10-16 11:19:04,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe013_rmo.opt.i
[2020-10-16 11:19:04,979 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/72c8aab15/3b7e757aa7274833a0f9e08b864696cd/FLAG442583015
[2020-10-16 11:19:05,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/72c8aab15/3b7e757aa7274833a0f9e08b864696cd
[2020-10-16 11:19:05,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 11:19:05,349 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 11:19:05,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 11:19:05,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 11:19:05,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 11:19:05,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:19:05" (1/1) ...
[2020-10-16 11:19:05,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b05ae09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:05, skipping insertion in model container
[2020-10-16 11:19:05,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:19:05" (1/1) ...
[2020-10-16 11:19:05,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-10-16 11:19:05,428 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-10-16 11:19:05,905 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:19:05,918 INFO L203 MainTranslator]: Completed pre-run
[2020-10-16 11:19:05,980 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:19:06,053 INFO L208 MainTranslator]: Completed translation
[2020-10-16 11:19:06,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:06 WrapperNode
[2020-10-16 11:19:06,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 11:19:06,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 11:19:06,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 11:19:06,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 11:19:06,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:06" (1/1) ...
[2020-10-16 11:19:06,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:06" (1/1) ...
[2020-10-16 11:19:06,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 11:19:06,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 11:19:06,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 11:19:06,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 11:19:06,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:06" (1/1) ...
[2020-10-16 11:19:06,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:06" (1/1) ...
[2020-10-16 11:19:06,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:06" (1/1) ...
[2020-10-16 11:19:06,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:06" (1/1) ...
[2020-10-16 11:19:06,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:06" (1/1) ...
[2020-10-16 11:19:06,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:06" (1/1) ...
[2020-10-16 11:19:06,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:06" (1/1) ...
[2020-10-16 11:19:06,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 11:19:06,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 11:19:06,169 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 11:19:06,169 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-10-16 11:19:06,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:06" (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 11:19:06,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 11:19:06,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 11:19:06,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 11:19:06,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 11:19:06,239 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 11:19:06,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 11:19:06,240 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 11:19:06,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 11:19:06,240 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 11:19:06,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 11:19:06,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 11:19:06,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 11:19:06,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 11:19:06,243 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 11:19:08,283 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 11:19:08,284 INFO L298 CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 11:19:08,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:19:08 BoogieIcfgContainer
[2020-10-16 11:19:08,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 11:19:08,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 11:19:08,288 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 11:19:08,293 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-10-16 11:19:08,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:19:05" (1/3) ...
[2020-10-16 11:19:08,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257ded58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:19:08, skipping insertion in model container
[2020-10-16 11:19:08,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:06" (2/3) ...
[2020-10-16 11:19:08,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257ded58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:19:08, skipping insertion in model container
[2020-10-16 11:19:08,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:19:08" (3/3) ...
[2020-10-16 11:19:08,297 INFO L111 eAbstractionObserver]: Analyzing ICFG safe013_rmo.opt.i
[2020-10-16 11:19:08,310 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 11:19:08,310 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 11:19:08,319 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 11:19:08,320 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 11:19:08,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,353 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,353 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,363 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,367 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,367 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,374 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,375 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,379 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,380 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,384 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,392 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,392 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,393 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:08,397 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 11:19:08,412 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 11:19:08,434 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2020-10-16 11:19:08,435 INFO L378 AbstractCegarLoop]: Hoare is true
[2020-10-16 11:19:08,435 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 11:19:08,435 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 11:19:08,435 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 11:19:08,435 INFO L382 AbstractCegarLoop]: Difference is false
[2020-10-16 11:19:08,435 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 11:19:08,436 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 11:19:08,450 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 11:19:08,453 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow
[2020-10-16 11:19:08,456 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow
[2020-10-16 11:19:08,458 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow
[2020-10-16 11:19:08,503 INFO L129 PetriNetUnfolder]: 2/89 cut-off events.
[2020-10-16 11:19:08,503 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 11:19:08,508 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 11:19:08,512 INFO L117 LiptonReduction]: Number of co-enabled transitions 1544
[2020-10-16 11:19:08,819 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 11:19:09,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:19:09,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:09,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:19:09,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:09,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:09,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:09,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:09,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:09,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:09,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:09,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:09,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:09,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:09,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:09,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:09,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:09,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:09,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:09,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:09,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:09,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:09,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:09,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:09,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:09,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:09,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:09,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:09,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:09,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:09,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:09,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:09,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:09,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:09,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:09,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:09,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:10,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:10,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:10,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:10,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:10,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:10,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:10,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:10,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:10,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:10,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:10,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:10,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:10,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:10,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:10,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:10,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:10,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:10,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:10,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:10,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:10,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:10,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:10,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:10,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:10,557 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 11:19:10,685 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 11:19:10,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:10,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:10,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:10,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:10,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:10,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:10,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:10,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:10,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:10,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:10,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:10,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:10,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:10,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:10,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:10,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:10,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:11,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:11,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:11,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:11,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:19:11,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:11,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:11,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:11,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:11,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:11,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:11,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:11,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:11,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:11,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:11,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:11,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:11,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:11,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:11,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:11,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:11,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:11,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:11,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:11,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:11,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:11,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:19:11,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:11,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:11,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:11,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:11,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:11,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:11,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:11,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:11,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:11,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:11,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:11,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:11,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:11,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:19:11,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:11,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:12,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:12,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:12,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:12,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:12,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:12,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:12,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:12,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:12,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:12,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:12,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:12,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:12,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:12,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:12,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:12,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:12,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:12,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:12,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:12,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:12,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:12,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:12,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:12,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:12,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:12,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:12,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:12,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:12,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:19:12,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:12,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:12,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:12,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:12,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:12,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:12,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:12,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:12,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:12,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:12,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:12,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:12,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:12,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:12,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:12,798 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36
[2020-10-16 11:19:13,382 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83
[2020-10-16 11:19:13,533 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2020-10-16 11:19:13,730 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2020-10-16 11:19:13,840 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2020-10-16 11:19:13,863 INFO L132 LiptonReduction]: Checked pairs total: 4509
[2020-10-16 11:19:13,863 INFO L134 LiptonReduction]: Total number of compositions: 79
[2020-10-16 11:19:13,884 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow
[2020-10-16 11:19:13,938 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 658 states.
[2020-10-16 11:19:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states.
[2020-10-16 11:19:13,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-16 11:19:13,949 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:19:13,950 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-16 11:19:13,950 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 11:19:13,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:13,956 INFO L82 PathProgramCache]: Analyzing trace with hash 913711493, now seen corresponding path program 1 times
[2020-10-16 11:19:13,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:13,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966897598]
[2020-10-16 11:19:13,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:14,185 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 11:19:14,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966897598]
[2020-10-16 11:19:14,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:14,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:19:14,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560696410]
[2020-10-16 11:19:14,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:19:14,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:14,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:19:14,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:14,208 INFO L87 Difference]: Start difference. First operand 658 states. Second operand 3 states.
[2020-10-16 11:19:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:14,295 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions.
[2020-10-16 11:19:14,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:19:14,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-16 11:19:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:14,316 INFO L225 Difference]: With dead ends: 550
[2020-10-16 11:19:14,317 INFO L226 Difference]: Without dead ends: 450
[2020-10-16 11:19:14,318 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 11:19:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states.
[2020-10-16 11:19:14,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450.
[2020-10-16 11:19:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states.
[2020-10-16 11:19:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions.
[2020-10-16 11:19:14,405 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 5
[2020-10-16 11:19:14,405 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:14,405 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions.
[2020-10-16 11:19:14,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:19:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions.
[2020-10-16 11:19:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 11:19:14,407 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:19:14,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:14,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 11:19:14,408 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 11:19:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:14,408 INFO L82 PathProgramCache]: Analyzing trace with hash -421820418, now seen corresponding path program 1 times
[2020-10-16 11:19:14,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:14,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705798676]
[2020-10-16 11:19:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:14,519 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 11:19:14,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705798676]
[2020-10-16 11:19:14,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:14,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:19:14,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98717391]
[2020-10-16 11:19:14,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:19:14,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:14,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:19:14,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:14,523 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states.
[2020-10-16 11:19:14,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:14,534 INFO L93 Difference]: Finished difference Result 430 states and 1287 transitions.
[2020-10-16 11:19:14,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:19:14,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 11:19:14,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:14,540 INFO L225 Difference]: With dead ends: 430
[2020-10-16 11:19:14,540 INFO L226 Difference]: Without dead ends: 430
[2020-10-16 11:19:14,541 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 11:19:14,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states.
[2020-10-16 11:19:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430.
[2020-10-16 11:19:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2020-10-16 11:19:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1287 transitions.
[2020-10-16 11:19:14,568 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1287 transitions. Word has length 9
[2020-10-16 11:19:14,572 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:14,572 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 1287 transitions.
[2020-10-16 11:19:14,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:19:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1287 transitions.
[2020-10-16 11:19:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 11:19:14,574 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:19:14,575 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:14,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 11:19:14,575 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 11:19:14,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:14,575 INFO L82 PathProgramCache]: Analyzing trace with hash -191532040, now seen corresponding path program 1 times
[2020-10-16 11:19:14,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:14,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26239251]
[2020-10-16 11:19:14,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:14,665 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 11:19:14,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26239251]
[2020-10-16 11:19:14,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:14,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:19:14,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595888545]
[2020-10-16 11:19:14,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:19:14,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:14,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:19:14,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:19:14,667 INFO L87 Difference]: Start difference. First operand 430 states and 1287 transitions. Second operand 4 states.
[2020-10-16 11:19:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:14,698 INFO L93 Difference]: Finished difference Result 542 states and 1583 transitions.
[2020-10-16 11:19:14,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 11:19:14,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2020-10-16 11:19:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:14,702 INFO L225 Difference]: With dead ends: 542
[2020-10-16 11:19:14,702 INFO L226 Difference]: Without dead ends: 302
[2020-10-16 11:19:14,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 11:19:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states.
[2020-10-16 11:19:14,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302.
[2020-10-16 11:19:14,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states.
[2020-10-16 11:19:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 847 transitions.
[2020-10-16 11:19:14,716 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 847 transitions. Word has length 10
[2020-10-16 11:19:14,716 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:14,717 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 847 transitions.
[2020-10-16 11:19:14,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:19:14,717 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 847 transitions.
[2020-10-16 11:19:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:19:14,719 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:19:14,719 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:14,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 11:19:14,719 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 11:19:14,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash 621784461, now seen corresponding path program 1 times
[2020-10-16 11:19:14,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:14,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325473740]
[2020-10-16 11:19:14,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:14,761 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 11:19:14,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325473740]
[2020-10-16 11:19:14,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:14,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:19:14,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832705843]
[2020-10-16 11:19:14,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:19:14,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:14,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:19:14,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:14,766 INFO L87 Difference]: Start difference. First operand 302 states and 847 transitions. Second operand 3 states.
[2020-10-16 11:19:14,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:14,776 INFO L93 Difference]: Finished difference Result 299 states and 836 transitions.
[2020-10-16 11:19:14,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:19:14,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-16 11:19:14,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:14,779 INFO L225 Difference]: With dead ends: 299
[2020-10-16 11:19:14,779 INFO L226 Difference]: Without dead ends: 299
[2020-10-16 11:19:14,780 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 11:19:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states.
[2020-10-16 11:19:14,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299.
[2020-10-16 11:19:14,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states.
[2020-10-16 11:19:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 836 transitions.
[2020-10-16 11:19:14,790 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 836 transitions. Word has length 12
[2020-10-16 11:19:14,790 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:14,790 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 836 transitions.
[2020-10-16 11:19:14,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:19:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 836 transitions.
[2020-10-16 11:19:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 11:19:14,793 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:19:14,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:14,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 11:19:14,793 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 11:19:14,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:14,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1298541099, now seen corresponding path program 1 times
[2020-10-16 11:19:14,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:14,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996863428]
[2020-10-16 11:19:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:14,885 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 11:19:14,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996863428]
[2020-10-16 11:19:14,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:14,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:19:14,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712209702]
[2020-10-16 11:19:14,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:19:14,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:14,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:19:14,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:19:14,888 INFO L87 Difference]: Start difference. First operand 299 states and 836 transitions. Second operand 4 states.
[2020-10-16 11:19:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:14,928 INFO L93 Difference]: Finished difference Result 291 states and 721 transitions.
[2020-10-16 11:19:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-10-16 11:19:14,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-16 11:19:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:14,931 INFO L225 Difference]: With dead ends: 291
[2020-10-16 11:19:14,931 INFO L226 Difference]: Without dead ends: 223
[2020-10-16 11:19:14,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:19:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states.
[2020-10-16 11:19:14,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223.
[2020-10-16 11:19:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states.
[2020-10-16 11:19:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 544 transitions.
[2020-10-16 11:19:14,939 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 544 transitions. Word has length 13
[2020-10-16 11:19:14,939 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:14,939 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 544 transitions.
[2020-10-16 11:19:14,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:19:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 544 transitions.
[2020-10-16 11:19:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 11:19:14,941 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:19:14,941 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:14,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 11:19:14,941 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 11:19:14,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:14,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1613655544, now seen corresponding path program 1 times
[2020-10-16 11:19:14,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:14,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886217157]
[2020-10-16 11:19:14,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:15,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:15,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886217157]
[2020-10-16 11:19:15,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:15,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:19:15,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374668092]
[2020-10-16 11:19:15,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:19:15,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:15,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:19:15,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:19:15,111 INFO L87 Difference]: Start difference. First operand 223 states and 544 transitions. Second operand 5 states.
[2020-10-16 11:19:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:15,158 INFO L93 Difference]: Finished difference Result 185 states and 411 transitions.
[2020-10-16 11:19:15,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-10-16 11:19:15,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-16 11:19:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:15,159 INFO L225 Difference]: With dead ends: 185
[2020-10-16 11:19:15,160 INFO L226 Difference]: Without dead ends: 147
[2020-10-16 11:19:15,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:19:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states.
[2020-10-16 11:19:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147.
[2020-10-16 11:19:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2020-10-16 11:19:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 320 transitions.
[2020-10-16 11:19:15,165 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 320 transitions. Word has length 15
[2020-10-16 11:19:15,165 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:15,165 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 320 transitions.
[2020-10-16 11:19:15,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:19:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 320 transitions.
[2020-10-16 11:19:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:19:15,166 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:19:15,166 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 11:19:15,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 11:19:15,167 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 11:19:15,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:15,167 INFO L82 PathProgramCache]: Analyzing trace with hash 2041535800, now seen corresponding path program 1 times
[2020-10-16 11:19:15,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:15,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882386316]
[2020-10-16 11:19:15,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:15,280 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 11:19:15,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882386316]
[2020-10-16 11:19:15,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:15,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:19:15,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942562184]
[2020-10-16 11:19:15,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:19:15,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:15,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:19:15,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:19:15,282 INFO L87 Difference]: Start difference. First operand 147 states and 320 transitions. Second operand 6 states.
[2020-10-16 11:19:15,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:15,337 INFO L93 Difference]: Finished difference Result 131 states and 286 transitions.
[2020-10-16 11:19:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-10-16 11:19:15,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17
[2020-10-16 11:19:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:15,339 INFO L225 Difference]: With dead ends: 131
[2020-10-16 11:19:15,340 INFO L226 Difference]: Without dead ends: 121
[2020-10-16 11:19:15,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:19:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2020-10-16 11:19:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121.
[2020-10-16 11:19:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states.
[2020-10-16 11:19:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 268 transitions.
[2020-10-16 11:19:15,344 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 268 transitions. Word has length 17
[2020-10-16 11:19:15,344 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:15,344 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 268 transitions.
[2020-10-16 11:19:15,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:19:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 268 transitions.
[2020-10-16 11:19:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:19:15,345 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:19:15,345 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 11:19:15,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 11:19:15,346 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 11:19:15,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:15,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1929467529, now seen corresponding path program 1 times
[2020-10-16 11:19:15,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:15,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934964686]
[2020-10-16 11:19:15,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:15,396 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 11:19:15,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934964686]
[2020-10-16 11:19:15,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:15,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:19:15,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89503671]
[2020-10-16 11:19:15,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:19:15,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:15,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:19:15,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:15,399 INFO L87 Difference]: Start difference. First operand 121 states and 268 transitions. Second operand 3 states.
[2020-10-16 11:19:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:15,407 INFO L93 Difference]: Finished difference Result 150 states and 324 transitions.
[2020-10-16 11:19:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:19:15,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20
[2020-10-16 11:19:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:15,408 INFO L225 Difference]: With dead ends: 150
[2020-10-16 11:19:15,409 INFO L226 Difference]: Without dead ends: 61
[2020-10-16 11:19:15,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2020-10-16 11:19:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61.
[2020-10-16 11:19:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2020-10-16 11:19:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions.
[2020-10-16 11:19:15,411 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 112 transitions. Word has length 20
[2020-10-16 11:19:15,412 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:15,412 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 112 transitions.
[2020-10-16 11:19:15,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:19:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions.
[2020-10-16 11:19:15,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:19:15,413 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:19:15,413 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 11:19:15,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 11:19:15,413 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 11:19:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:15,414 INFO L82 PathProgramCache]: Analyzing trace with hash -439366969, now seen corresponding path program 2 times
[2020-10-16 11:19:15,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:15,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378637101]
[2020-10-16 11:19:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:15,695 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 11:19:15,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378637101]
[2020-10-16 11:19:15,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:15,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:19:15,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876568430]
[2020-10-16 11:19:15,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:19:15,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:15,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:19:15,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:19:15,699 INFO L87 Difference]: Start difference. First operand 61 states and 112 transitions. Second operand 7 states.
[2020-10-16 11:19:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:15,809 INFO L93 Difference]: Finished difference Result 75 states and 134 transitions.
[2020-10-16 11:19:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-10-16 11:19:15,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20
[2020-10-16 11:19:15,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:15,810 INFO L225 Difference]: With dead ends: 75
[2020-10-16 11:19:15,810 INFO L226 Difference]: Without dead ends: 41
[2020-10-16 11:19:15,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2020-10-16 11:19:15,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2020-10-16 11:19:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2020-10-16 11:19:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2020-10-16 11:19:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions.
[2020-10-16 11:19:15,813 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 20
[2020-10-16 11:19:15,813 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:15,813 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions.
[2020-10-16 11:19:15,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:19:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions.
[2020-10-16 11:19:15,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:19:15,814 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:19:15,814 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 11:19:15,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 11:19:15,814 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 11:19:15,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:15,815 INFO L82 PathProgramCache]: Analyzing trace with hash -483881779, now seen corresponding path program 3 times
[2020-10-16 11:19:15,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:15,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16815987]
[2020-10-16 11:19:15,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:19:15,916 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:19:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:19:15,972 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:19:16,009 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 11:19:16,009 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 11:19:16,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 11:19:16,010 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 11:19:16,024 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L829-->L836: Formula: (let ((.cse7 (= (mod ~x$r_buff0_thd0~0_In-1173827557 256) 0)) (.cse6 (= (mod ~x$w_buff0_used~0_In-1173827557 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In-1173827557 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-1173827557 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and (= ~x$w_buff1_used~0_Out-1173827557 0) .cse0 .cse1) (and .cse2 (= ~x$w_buff1_used~0_In-1173827557 ~x$w_buff1_used~0_Out-1173827557))) (= ~x$r_buff1_thd0~0_Out-1173827557 ~x$r_buff1_thd0~0_In-1173827557) (or (and .cse3 (= ~x$w_buff0_used~0_Out-1173827557 ~x$w_buff0_used~0_In-1173827557)) (and .cse4 (= ~x$w_buff0_used~0_Out-1173827557 0) .cse5)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1173827557| ULTIMATE.start_assume_abort_if_not_~cond_Out-1173827557) (or (and (or (and (= ~x$w_buff1~0_In-1173827557 ~x~0_Out-1173827557) .cse0 .cse1) (and (= ~x~0_In-1173827557 ~x~0_Out-1173827557) .cse2)) .cse3) (and .cse4 (= ~x$w_buff0~0_In-1173827557 ~x~0_Out-1173827557) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1173827557 0)) (= ~x$r_buff0_thd0~0_In-1173827557 ~x$r_buff0_thd0~0_Out-1173827557)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1173827557, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1173827557, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1173827557|, ~x$w_buff1~0=~x$w_buff1~0_In-1173827557, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1173827557, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1173827557, ~x~0=~x~0_In-1173827557, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1173827557} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1173827557, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1173827557, ~x$w_buff1~0=~x$w_buff1~0_In-1173827557, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1173827557, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1173827557, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1173827557|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1173827557|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1173827557|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1173827557, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1173827557|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1173827557|, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1173827557|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1173827557|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1173827557, ~x~0=~x~0_Out-1173827557} 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 11:19:16,030 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 11:19:16,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,032 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 11:19:16,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,032 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 11:19:16,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,032 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 11:19:16,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,033 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 11:19:16,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,033 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 11:19:16,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,034 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 11:19:16,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,034 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 11:19:16,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,035 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 11:19:16,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,035 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 11:19:16,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,035 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 11:19:16,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,036 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 11:19:16,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,036 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 11:19:16,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,037 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 11:19:16,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,037 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 11:19:16,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,040 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 11:19:16,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,041 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 11:19:16,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,041 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 11:19:16,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,041 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 11:19:16,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,042 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 11:19:16,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,042 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 11:19:16,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,043 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 11:19:16,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,043 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 11:19:16,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,043 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 11:19:16,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:16,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:19:16 BasicIcfg
[2020-10-16 11:19:16,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 11:19:16,105 INFO L168 Benchmark]: Toolchain (without parser) took 10756.05 ms. Allocated memory was 147.8 MB in the beginning and 378.0 MB in the end (delta: 230.2 MB). Free memory was 102.9 MB in the beginning and 263.1 MB in the end (delta: -160.2 MB). Peak memory consumption was 69.9 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:16,105 INFO L168 Benchmark]: CDTParser took 1.38 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-10-16 11:19:16,106 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.24 ms. Allocated memory was 147.8 MB in the beginning and 203.4 MB in the end (delta: 55.6 MB). Free memory was 102.7 MB in the beginning and 157.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:16,107 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.38 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:16,108 INFO L168 Benchmark]: Boogie Preprocessor took 50.79 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:16,108 INFO L168 Benchmark]: RCFGBuilder took 2117.59 ms. Allocated memory was 203.4 MB in the beginning and 246.9 MB in the end (delta: 43.5 MB). Free memory was 151.9 MB in the beginning and 189.8 MB in the end (delta: -38.0 MB). Peak memory consumption was 102.2 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:16,109 INFO L168 Benchmark]: TraceAbstraction took 7815.20 ms. Allocated memory was 246.9 MB in the beginning and 378.0 MB in the end (delta: 131.1 MB). Free memory was 189.8 MB in the beginning and 263.1 MB in the end (delta: -73.3 MB). Peak memory consumption was 57.8 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:16,113 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 1.38 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 703.24 ms. Allocated memory was 147.8 MB in the beginning and 203.4 MB in the end (delta: 55.6 MB). Free memory was 102.7 MB in the beginning and 157.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 63.38 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 50.79 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 2117.59 ms. Allocated memory was 203.4 MB in the beginning and 246.9 MB in the end (delta: 43.5 MB). Free memory was 151.9 MB in the beginning and 189.8 MB in the end (delta: -38.0 MB). Peak memory consumption was 102.2 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 7815.20 ms. Allocated memory was 246.9 MB in the beginning and 378.0 MB in the end (delta: 131.1 MB). Free memory was 189.8 MB in the beginning and 263.1 MB in the end (delta: -73.3 MB). Peak memory consumption was 57.8 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
1087 VarBasedMoverChecksPositive, 78 VarBasedMoverChecksNegative, 27 SemBasedMoverChecksPositive, 51 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 146 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.4s, 100 PlacesBefore, 35 PlacesAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1544 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 79 TotalNumberOfCompositions, 4509 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 t2088;
[L821] FCALL, FORK 0 pthread_create(&t2088, ((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 t2089;
[L823] FCALL, FORK 0 pthread_create(&t2089, ((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 t2090;
[L825] FCALL, FORK 0 pthread_create(&t2090, ((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=255, 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=255, 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: 7.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 197 SDtfs, 178 SDslu, 313 SDs, 0 SdLazy, 143 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s 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.6s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 7473 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...