/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.0-60729f1
[2020-11-11 23:17:17,219 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-11-11 23:17:17,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-11-11 23:17:17,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-11-11 23:17:17,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-11-11 23:17:17,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-11-11 23:17:17,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-11-11 23:17:17,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-11-11 23:17:17,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-11-11 23:17:17,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-11-11 23:17:17,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-11-11 23:17:17,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-11-11 23:17:17,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-11-11 23:17:17,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-11-11 23:17:17,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-11-11 23:17:17,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-11-11 23:17:17,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-11-11 23:17:17,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-11-11 23:17:17,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-11-11 23:17:17,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-11-11 23:17:17,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-11-11 23:17:17,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-11-11 23:17:17,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-11-11 23:17:17,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-11-11 23:17:17,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-11-11 23:17:17,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-11-11 23:17:17,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-11-11 23:17:17,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-11-11 23:17:17,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-11-11 23:17:17,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-11-11 23:17:17,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-11-11 23:17:17,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-11-11 23:17:17,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-11-11 23:17:17,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-11-11 23:17:17,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-11-11 23:17:17,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-11-11 23:17:17,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-11-11 23:17:17,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-11-11 23:17:17,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-11-11 23:17:17,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-11-11 23:17:17,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-11-11 23:17:17,318 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf
[2020-11-11 23:17:17,376 INFO L113 SettingsManager]: Loading preferences was successful
[2020-11-11 23:17:17,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-11-11 23:17:17,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-11-11 23:17:17,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-11-11 23:17:17,379 INFO L138 SettingsManager]: * Use SBE=true
[2020-11-11 23:17:17,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-11-11 23:17:17,380 INFO L138 SettingsManager]: * sizeof long=4
[2020-11-11 23:17:17,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-11-11 23:17:17,381 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-11-11 23:17:17,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-11-11 23:17:17,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-11-11 23:17:17,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-11-11 23:17:17,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-11-11 23:17:17,383 INFO L138 SettingsManager]: * sizeof long double=12
[2020-11-11 23:17:17,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-11-11 23:17:17,383 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-11-11 23:17:17,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-11-11 23:17:17,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-11-11 23:17:17,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-11-11 23:17:17,384 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-11-11 23:17:17,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-11-11 23:17:17,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-11-11 23:17:17,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-11-11 23:17:17,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2020-11-11 23:17:17,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-11-11 23:17:17,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-11-11 23:17:17,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-11-11 23:17:17,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-11-11 23:17:17,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2020-11-11 23:17:17,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2020-11-11 23:17:17,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-11-11 23:17:17,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-11-11 23:17:17,856 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-11-11 23:17:17,857 INFO L275 PluginConnector]: CDTParser initialized
[2020-11-11 23:17:17,858 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i
[2020-11-11 23:17:17,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72021b1d1/bce47599706f40178df2d11142610ddb/FLAGc0d88a871
[2020-11-11 23:17:18,771 INFO L306 CDTParser]: Found 1 translation units.
[2020-11-11 23:17:18,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i
[2020-11-11 23:17:18,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72021b1d1/bce47599706f40178df2d11142610ddb/FLAGc0d88a871
[2020-11-11 23:17:18,818 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72021b1d1/bce47599706f40178df2d11142610ddb
[2020-11-11 23:17:18,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-11-11 23:17:18,828 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2020-11-11 23:17:18,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-11-11 23:17:18,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-11-11 23:17:18,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-11-11 23:17:18,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:17:18" (1/1) ...
[2020-11-11 23:17:18,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@578354f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:18, skipping insertion in model container
[2020-11-11 23:17:18,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:17:18" (1/1) ...
[2020-11-11 23:17:18,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-11-11 23:17:18,894 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-11-11 23:17:19,394 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-11-11 23:17:19,412 INFO L203 MainTranslator]: Completed pre-run
[2020-11-11 23:17:19,503 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-11-11 23:17:19,651 INFO L208 MainTranslator]: Completed translation
[2020-11-11 23:17:19,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:19 WrapperNode
[2020-11-11 23:17:19,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-11-11 23:17:19,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-11-11 23:17:19,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-11-11 23:17:19,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2020-11-11 23:17:19,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:19" (1/1) ...
[2020-11-11 23:17:19,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:19" (1/1) ...
[2020-11-11 23:17:19,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-11-11 23:17:19,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-11-11 23:17:19,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-11-11 23:17:19,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-11-11 23:17:19,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:19" (1/1) ...
[2020-11-11 23:17:19,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:19" (1/1) ...
[2020-11-11 23:17:19,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:19" (1/1) ...
[2020-11-11 23:17:19,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:19" (1/1) ...
[2020-11-11 23:17:19,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:19" (1/1) ...
[2020-11-11 23:17:19,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:19" (1/1) ...
[2020-11-11 23:17:19,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:19" (1/1) ...
[2020-11-11 23:17:19,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-11-11 23:17:19,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-11-11 23:17:19,853 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-11-11 23:17:19,853 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-11-11 23:17:19,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:19" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-11-11 23:17:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2020-11-11 23:17:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-11-11 23:17:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-11-11 23:17:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-11-11 23:17:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2020-11-11 23:17:19,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2020-11-11 23:17:19,941 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2020-11-11 23:17:19,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2020-11-11 23:17:19,941 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2020-11-11 23:17:19,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2020-11-11 23:17:19,942 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2020-11-11 23:17:19,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2020-11-11 23:17:19,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2020-11-11 23:17:19,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-11-11 23:17:19,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-11-11 23:17:19,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-11-11 23:17:19,944 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-11-11 23:17:21,869 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-11-11 23:17:21,870 INFO L298 CfgBuilder]: Removed 14 assume(true) statements.
[2020-11-11 23:17:21,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:17:21 BoogieIcfgContainer
[2020-11-11 23:17:21,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-11-11 23:17:21,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-11-11 23:17:21,875 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-11-11 23:17:21,878 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-11-11 23:17:21,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:17:18" (1/3) ...
[2020-11-11 23:17:21,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9bf4f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:17:21, skipping insertion in model container
[2020-11-11 23:17:21,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:19" (2/3) ...
[2020-11-11 23:17:21,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9bf4f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:17:21, skipping insertion in model container
[2020-11-11 23:17:21,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:17:21" (3/3) ...
[2020-11-11 23:17:21,882 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_rmo.opt.i
[2020-11-11 23:17:21,898 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-11-11 23:17:21,899 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-11-11 23:17:21,903 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-11-11 23:17:21,904 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-11-11 23:17:21,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,944 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,944 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,945 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,945 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,947 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,948 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,948 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,948 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,950 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,950 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,951 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,951 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,972 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,972 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,973 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,973 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,973 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,974 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,974 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,974 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,974 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,974 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,975 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,977 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,981 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,981 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,982 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,982 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,984 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,985 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,992 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,994 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,998 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,999 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:21,999 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:22,000 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:22,000 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:22,000 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:22,000 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:22,000 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:22,001 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:22,001 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:22,001 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:22,003 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:22,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:22,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:22,004 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:17:22,005 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-11-11 23:17:22,018 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-11-11 23:17:22,042 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2020-11-11 23:17:22,042 INFO L378 AbstractCegarLoop]: Hoare is true
[2020-11-11 23:17:22,042 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-11-11 23:17:22,043 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-11-11 23:17:22,043 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-11-11 23:17:22,043 INFO L382 AbstractCegarLoop]: Difference is false
[2020-11-11 23:17:22,043 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-11-11 23:17:22,043 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-11-11 23:17:22,056 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-11-11 23:17:22,059 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow
[2020-11-11 23:17:22,062 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow
[2020-11-11 23:17:22,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow
[2020-11-11 23:17:22,121 INFO L129 PetriNetUnfolder]: 3/117 cut-off events.
[2020-11-11 23:17:22,121 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-11-11 23:17:22,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place.
[2020-11-11 23:17:22,131 INFO L116 LiptonReduction]: Number of co-enabled transitions 2712
[2020-11-11 23:17:22,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-11 23:17:22,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:22,943 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46
[2020-11-11 23:17:23,488 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-11-11 23:17:23,616 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-11-11 23:17:24,089 WARN L193 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81
[2020-11-11 23:17:24,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term
[2020-11-11 23:17:24,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:24,459 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83
[2020-11-11 23:17:24,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:24,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:24,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-11 23:17:24,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:17:24,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:17:24,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:17:24,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-11 23:17:24,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:17:24,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-11 23:17:24,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:24,581 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-11-11 23:17:24,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:24,585 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-11-11 23:17:24,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:24,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:17:24,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-11-11 23:17:24,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-11 23:17:24,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:24,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:24,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:24,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:24,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:24,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:24,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:17:24,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:24,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:17:24,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:24,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:24,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:24,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:24,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:24,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:17:24,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:24,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:17:25,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:25,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:25,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:25,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:25,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:25,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:17:25,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:25,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:17:25,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:25,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:25,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:25,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:25,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:25,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:17:25,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:25,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:17:26,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:26,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:26,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:26,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:26,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:26,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:26,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:26,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:26,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:26,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:26,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:26,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:26,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:26,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:17:26,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:26,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:17:26,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:17:26,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-11-11 23:17:26,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-11 23:17:26,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:26,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:26,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:26,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-11 23:17:26,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:17:26,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:17:26,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:17:26,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-11 23:17:26,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:17:26,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-11 23:17:26,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:26,565 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-11-11 23:17:26,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:26,567 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-11-11 23:17:26,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:26,708 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-11-11 23:17:26,841 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-11-11 23:17:27,047 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 84
[2020-11-11 23:17:27,269 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 84
[2020-11-11 23:17:27,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-11 23:17:27,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:27,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-11-11 23:17:27,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:27,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-11-11 23:17:27,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:27,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:27,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:27,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:27,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:27,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:27,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:17:27,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:27,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:17:27,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:27,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:27,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:27,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:27,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:27,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:27,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:27,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:28,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-11 23:17:28,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:28,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-11 23:17:28,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:28,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-11-11 23:17:28,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:28,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-11-11 23:17:28,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:28,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:28,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:28,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:28,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:28,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:28,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:28,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:28,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:17:28,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:28,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:28,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:28,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:17:28,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:17:28,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:17:28,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:17:28,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:17:29,849 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-11-11 23:17:29,965 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-11-11 23:17:30,078 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-11-11 23:17:30,188 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-11-11 23:17:30,737 WARN L193 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126
[2020-11-11 23:17:30,971 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 122
[2020-11-11 23:17:31,468 WARN L193 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126
[2020-11-11 23:17:31,715 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 122
[2020-11-11 23:17:31,723 INFO L131 LiptonReduction]: Checked pairs total: 6772
[2020-11-11 23:17:31,724 INFO L133 LiptonReduction]: Total number of compositions: 104
[2020-11-11 23:17:31,732 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow
[2020-11-11 23:17:31,976 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2858 states, 2854 states have (on average 4.0476524176594255) internal successors, (11552), 2857 states have internal predecessors, (11552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 2858 states, 2854 states have (on average 4.0476524176594255) internal successors, (11552), 2857 states have internal predecessors, (11552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-11-11 23:17:32,001 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-11 23:17:32,002 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:17:32,002 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:17:32,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:17:32,011 INFO L82 PathProgramCache]: Analyzing trace with hash -531598001, now seen corresponding path program 1 times
[2020-11-11 23:17:32,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:17:32,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550027669]
[2020-11-11 23:17:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:17:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:17:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:17:32,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550027669]
[2020-11-11 23:17:32,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:17:32,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-11-11 23:17:32,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243870697]
[2020-11-11 23:17:32,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-11-11 23:17:32,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:17:32,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-11-11 23:17:32,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-11-11 23:17:32,389 INFO L87 Difference]: Start difference. First operand has 2858 states, 2854 states have (on average 4.0476524176594255) internal successors, (11552), 2857 states have internal predecessors, (11552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:17:32,586 INFO L93 Difference]: Finished difference Result 2474 states and 9536 transitions.
[2020-11-11 23:17:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-11-11 23:17:32,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9
[2020-11-11 23:17:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:17:32,649 INFO L225 Difference]: With dead ends: 2474
[2020-11-11 23:17:32,649 INFO L226 Difference]: Without dead ends: 2090
[2020-11-11 23:17:32,651 INFO L749 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-11-11 23:17:32,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states.
[2020-11-11 23:17:32,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090.
[2020-11-11 23:17:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2089 states have (on average 3.814265198659646) internal successors, (7968), 2089 states have internal predecessors, (7968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7968 transitions.
[2020-11-11 23:17:32,873 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7968 transitions. Word has length 9
[2020-11-11 23:17:32,874 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:17:32,874 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 7968 transitions.
[2020-11-11 23:17:32,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7968 transitions.
[2020-11-11 23:17:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-11-11 23:17:32,886 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-11 23:17:32,886 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:17:32,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-11-11 23:17:32,886 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:17:32,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:17:32,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1289801197, now seen corresponding path program 1 times
[2020-11-11 23:17:32,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:17:32,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641121498]
[2020-11-11 23:17:32,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:17:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:17:33,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:17:33,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641121498]
[2020-11-11 23:17:33,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:17:33,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-11-11 23:17:33,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252584726]
[2020-11-11 23:17:33,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-11-11 23:17:33,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:17:33,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-11-11 23:17:33,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-11-11 23:17:33,075 INFO L87 Difference]: Start difference. First operand 2090 states and 7968 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:17:33,151 INFO L93 Difference]: Finished difference Result 2378 states and 8760 transitions.
[2020-11-11 23:17:33,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-11-11 23:17:33,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12
[2020-11-11 23:17:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:17:33,173 INFO L225 Difference]: With dead ends: 2378
[2020-11-11 23:17:33,173 INFO L226 Difference]: Without dead ends: 1994
[2020-11-11 23:17:33,175 INFO L749 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-11-11 23:17:33,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states.
[2020-11-11 23:17:33,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1994.
[2020-11-11 23:17:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1994 states, 1993 states have (on average 3.777220270948319) internal successors, (7528), 1993 states have internal predecessors, (7528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 7528 transitions.
[2020-11-11 23:17:33,292 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 7528 transitions. Word has length 12
[2020-11-11 23:17:33,292 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:17:33,293 INFO L481 AbstractCegarLoop]: Abstraction has 1994 states and 7528 transitions.
[2020-11-11 23:17:33,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 7528 transitions.
[2020-11-11 23:17:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-11-11 23:17:33,296 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-11 23:17:33,296 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:17:33,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-11-11 23:17:33,297 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:17:33,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:17:33,307 INFO L82 PathProgramCache]: Analyzing trace with hash -501628447, now seen corresponding path program 1 times
[2020-11-11 23:17:33,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:17:33,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011274962]
[2020-11-11 23:17:33,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:17:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:17:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:17:33,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011274962]
[2020-11-11 23:17:33,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:17:33,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-11-11 23:17:33,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596700593]
[2020-11-11 23:17:33,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-11-11 23:17:33,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:17:33,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-11-11 23:17:33,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-11-11 23:17:33,449 INFO L87 Difference]: Start difference. First operand 1994 states and 7528 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:17:33,510 INFO L93 Difference]: Finished difference Result 2106 states and 7716 transitions.
[2020-11-11 23:17:33,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-11-11 23:17:33,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13
[2020-11-11 23:17:33,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:17:33,529 INFO L225 Difference]: With dead ends: 2106
[2020-11-11 23:17:33,529 INFO L226 Difference]: Without dead ends: 1770
[2020-11-11 23:17:33,530 INFO L749 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-11-11 23:17:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states.
[2020-11-11 23:17:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1770.
[2020-11-11 23:17:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1769 states have (on average 3.7263990955342) internal successors, (6592), 1769 states have internal predecessors, (6592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 6592 transitions.
[2020-11-11 23:17:33,621 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 6592 transitions. Word has length 13
[2020-11-11 23:17:33,622 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:17:33,622 INFO L481 AbstractCegarLoop]: Abstraction has 1770 states and 6592 transitions.
[2020-11-11 23:17:33,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 6592 transitions.
[2020-11-11 23:17:33,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-11-11 23:17:33,626 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-11 23:17:33,626 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:17:33,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-11-11 23:17:33,626 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:17:33,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:17:33,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1412806912, now seen corresponding path program 1 times
[2020-11-11 23:17:33,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:17:33,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784058392]
[2020-11-11 23:17:33,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:17:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:17:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:17:33,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784058392]
[2020-11-11 23:17:33,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:17:33,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-11-11 23:17:33,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601634294]
[2020-11-11 23:17:33,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-11-11 23:17:33,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:17:33,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-11-11 23:17:33,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-11-11 23:17:33,721 INFO L87 Difference]: Start difference. First operand 1770 states and 6592 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:17:33,782 INFO L93 Difference]: Finished difference Result 1758 states and 5931 transitions.
[2020-11-11 23:17:33,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-11-11 23:17:33,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2020-11-11 23:17:33,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:17:33,796 INFO L225 Difference]: With dead ends: 1758
[2020-11-11 23:17:33,796 INFO L226 Difference]: Without dead ends: 1374
[2020-11-11 23:17:33,797 INFO L749 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-11-11 23:17:33,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states.
[2020-11-11 23:17:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374.
[2020-11-11 23:17:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1373 states have (on average 3.3590677348871085) internal successors, (4612), 1373 states have internal predecessors, (4612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:33,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 4612 transitions.
[2020-11-11 23:17:33,856 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 4612 transitions. Word has length 15
[2020-11-11 23:17:33,856 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:17:33,856 INFO L481 AbstractCegarLoop]: Abstraction has 1374 states and 4612 transitions.
[2020-11-11 23:17:33,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 4612 transitions.
[2020-11-11 23:17:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-11-11 23:17:33,860 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-11 23:17:33,861 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:17:33,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-11-11 23:17:33,861 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:17:33,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:17:33,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1054671020, now seen corresponding path program 1 times
[2020-11-11 23:17:33,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:17:33,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414432022]
[2020-11-11 23:17:33,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:17:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:17:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:17:33,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414432022]
[2020-11-11 23:17:33,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:17:33,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-11-11 23:17:33,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231653186]
[2020-11-11 23:17:33,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-11-11 23:17:33,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:17:33,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-11-11 23:17:33,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-11-11 23:17:33,961 INFO L87 Difference]: Start difference. First operand 1374 states and 4612 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:34,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:17:34,017 INFO L93 Difference]: Finished difference Result 2050 states and 6610 transitions.
[2020-11-11 23:17:34,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-11-11 23:17:34,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17
[2020-11-11 23:17:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:17:34,032 INFO L225 Difference]: With dead ends: 2050
[2020-11-11 23:17:34,032 INFO L226 Difference]: Without dead ends: 1448
[2020-11-11 23:17:34,033 INFO L749 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-11-11 23:17:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states.
[2020-11-11 23:17:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1328.
[2020-11-11 23:17:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1327 states have (on average 3.2102486812358704) internal successors, (4260), 1327 states have internal predecessors, (4260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 4260 transitions.
[2020-11-11 23:17:34,092 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 4260 transitions. Word has length 17
[2020-11-11 23:17:34,092 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:17:34,092 INFO L481 AbstractCegarLoop]: Abstraction has 1328 states and 4260 transitions.
[2020-11-11 23:17:34,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 4260 transitions.
[2020-11-11 23:17:34,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-11-11 23:17:34,096 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-11 23:17:34,096 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:17:34,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-11-11 23:17:34,097 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:17:34,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:17:34,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2090315744, now seen corresponding path program 1 times
[2020-11-11 23:17:34,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:17:34,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223410088]
[2020-11-11 23:17:34,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:17:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:17:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:17:34,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223410088]
[2020-11-11 23:17:34,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:17:34,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-11-11 23:17:34,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849695834]
[2020-11-11 23:17:34,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-11-11 23:17:34,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:17:34,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-11-11 23:17:34,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-11-11 23:17:34,207 INFO L87 Difference]: Start difference. First operand 1328 states and 4260 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:17:34,297 INFO L93 Difference]: Finished difference Result 1091 states and 3142 transitions.
[2020-11-11 23:17:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-11-11 23:17:34,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17
[2020-11-11 23:17:34,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:17:34,305 INFO L225 Difference]: With dead ends: 1091
[2020-11-11 23:17:34,306 INFO L226 Difference]: Without dead ends: 842
[2020-11-11 23:17:34,306 INFO L749 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-11-11 23:17:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states.
[2020-11-11 23:17:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842.
[2020-11-11 23:17:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 2.8275862068965516) internal successors, (2378), 841 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2378 transitions.
[2020-11-11 23:17:34,338 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 2378 transitions. Word has length 17
[2020-11-11 23:17:34,339 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:17:34,339 INFO L481 AbstractCegarLoop]: Abstraction has 842 states and 2378 transitions.
[2020-11-11 23:17:34,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 2378 transitions.
[2020-11-11 23:17:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-11-11 23:17:34,341 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-11 23:17:34,342 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:17:34,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-11-11 23:17:34,342 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:17:34,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:17:34,342 INFO L82 PathProgramCache]: Analyzing trace with hash -634867226, now seen corresponding path program 1 times
[2020-11-11 23:17:34,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:17:34,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253823331]
[2020-11-11 23:17:34,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:17:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:17:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:17:34,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253823331]
[2020-11-11 23:17:34,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:17:34,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-11-11 23:17:34,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459039690]
[2020-11-11 23:17:34,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-11-11 23:17:34,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:17:34,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-11-11 23:17:34,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-11-11 23:17:34,465 INFO L87 Difference]: Start difference. First operand 842 states and 2378 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:34,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:17:34,551 INFO L93 Difference]: Finished difference Result 695 states and 1915 transitions.
[2020-11-11 23:17:34,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-11-11 23:17:34,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20
[2020-11-11 23:17:34,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:17:34,559 INFO L225 Difference]: With dead ends: 695
[2020-11-11 23:17:34,559 INFO L226 Difference]: Without dead ends: 608
[2020-11-11 23:17:34,560 INFO L749 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-11-11 23:17:34,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states.
[2020-11-11 23:17:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608.
[2020-11-11 23:17:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 2.7940691927512358) internal successors, (1696), 607 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1696 transitions.
[2020-11-11 23:17:34,631 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1696 transitions. Word has length 20
[2020-11-11 23:17:34,632 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:17:34,632 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 1696 transitions.
[2020-11-11 23:17:34,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1696 transitions.
[2020-11-11 23:17:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-11-11 23:17:34,635 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-11 23:17:34,635 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:17:34,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-11-11 23:17:34,636 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:17:34,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:17:34,636 INFO L82 PathProgramCache]: Analyzing trace with hash 377418094, now seen corresponding path program 1 times
[2020-11-11 23:17:34,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:17:34,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148990196]
[2020-11-11 23:17:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:17:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:17:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:17:34,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148990196]
[2020-11-11 23:17:34,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:17:34,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-11-11 23:17:34,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019728420]
[2020-11-11 23:17:34,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-11-11 23:17:34,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:17:34,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-11-11 23:17:34,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-11-11 23:17:34,766 INFO L87 Difference]: Start difference. First operand 608 states and 1696 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:17:34,825 INFO L93 Difference]: Finished difference Result 838 states and 2251 transitions.
[2020-11-11 23:17:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-11-11 23:17:34,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23
[2020-11-11 23:17:34,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:17:34,831 INFO L225 Difference]: With dead ends: 838
[2020-11-11 23:17:34,831 INFO L226 Difference]: Without dead ends: 564
[2020-11-11 23:17:34,834 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-11-11 23:17:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states.
[2020-11-11 23:17:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 560.
[2020-11-11 23:17:34,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 2.5688729874776386) internal successors, (1436), 559 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1436 transitions.
[2020-11-11 23:17:34,855 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1436 transitions. Word has length 23
[2020-11-11 23:17:34,855 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:17:34,855 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 1436 transitions.
[2020-11-11 23:17:34,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1436 transitions.
[2020-11-11 23:17:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-11-11 23:17:34,857 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-11 23:17:34,858 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:17:34,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-11-11 23:17:34,858 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:17:34,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:17:34,858 INFO L82 PathProgramCache]: Analyzing trace with hash 847713258, now seen corresponding path program 1 times
[2020-11-11 23:17:34,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:17:34,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744038763]
[2020-11-11 23:17:34,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:17:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:17:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:17:34,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744038763]
[2020-11-11 23:17:34,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:17:34,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-11-11 23:17:34,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332937335]
[2020-11-11 23:17:34,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-11-11 23:17:34,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:17:34,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-11-11 23:17:34,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-11-11 23:17:34,961 INFO L87 Difference]: Start difference. First operand 560 states and 1436 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:17:35,009 INFO L93 Difference]: Finished difference Result 733 states and 1821 transitions.
[2020-11-11 23:17:35,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-11-11 23:17:35,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23
[2020-11-11 23:17:35,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:17:35,014 INFO L225 Difference]: With dead ends: 733
[2020-11-11 23:17:35,014 INFO L226 Difference]: Without dead ends: 440
[2020-11-11 23:17:35,015 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-11-11 23:17:35,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states.
[2020-11-11 23:17:35,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 434.
[2020-11-11 23:17:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.321016166281755) internal successors, (1005), 433 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1005 transitions.
[2020-11-11 23:17:35,030 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1005 transitions. Word has length 23
[2020-11-11 23:17:35,030 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:17:35,030 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1005 transitions.
[2020-11-11 23:17:35,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1005 transitions.
[2020-11-11 23:17:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-11-11 23:17:35,034 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-11 23:17:35,034 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:17:35,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-11-11 23:17:35,035 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:17:35,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:17:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1673387358, now seen corresponding path program 2 times
[2020-11-11 23:17:35,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:17:35,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941601045]
[2020-11-11 23:17:35,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:17:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:17:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:17:35,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941601045]
[2020-11-11 23:17:35,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:17:35,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-11-11 23:17:35,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821696237]
[2020-11-11 23:17:35,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-11-11 23:17:35,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:17:35,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-11-11 23:17:35,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-11-11 23:17:35,130 INFO L87 Difference]: Start difference. First operand 434 states and 1005 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:17:35,206 INFO L93 Difference]: Finished difference Result 399 states and 936 transitions.
[2020-11-11 23:17:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2020-11-11 23:17:35,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23
[2020-11-11 23:17:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:17:35,208 INFO L225 Difference]: With dead ends: 399
[2020-11-11 23:17:35,208 INFO L226 Difference]: Without dead ends: 81
[2020-11-11 23:17:35,208 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-11-11 23:17:35,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2020-11-11 23:17:35,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81.
[2020-11-11 23:17:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 2.0875) internal successors, (167), 80 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 167 transitions.
[2020-11-11 23:17:35,211 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 167 transitions. Word has length 23
[2020-11-11 23:17:35,211 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:17:35,212 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 167 transitions.
[2020-11-11 23:17:35,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:35,212 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 167 transitions.
[2020-11-11 23:17:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-11-11 23:17:35,212 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-11 23:17:35,213 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:17:35,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-11-11 23:17:35,213 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:17:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:17:35,213 INFO L82 PathProgramCache]: Analyzing trace with hash -246252320, now seen corresponding path program 1 times
[2020-11-11 23:17:35,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:17:35,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440724956]
[2020-11-11 23:17:35,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:17:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:17:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:17:35,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440724956]
[2020-11-11 23:17:35,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:17:35,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-11-11 23:17:35,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855584259]
[2020-11-11 23:17:35,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-11-11 23:17:35,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:17:35,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-11-11 23:17:35,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-11-11 23:17:35,374 INFO L87 Difference]: Start difference. First operand 81 states and 167 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:17:35,465 INFO L93 Difference]: Finished difference Result 100 states and 202 transitions.
[2020-11-11 23:17:35,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-11-11 23:17:35,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26
[2020-11-11 23:17:35,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:17:35,466 INFO L225 Difference]: With dead ends: 100
[2020-11-11 23:17:35,466 INFO L226 Difference]: Without dead ends: 53
[2020-11-11 23:17:35,467 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-11-11 23:17:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2020-11-11 23:17:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53.
[2020-11-11 23:17:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.75) internal successors, (91), 52 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 91 transitions.
[2020-11-11 23:17:35,469 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 91 transitions. Word has length 26
[2020-11-11 23:17:35,470 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:17:35,470 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 91 transitions.
[2020-11-11 23:17:35,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:17:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 91 transitions.
[2020-11-11 23:17:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-11-11 23:17:35,473 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-11 23:17:35,473 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:17:35,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-11-11 23:17:35,473 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:17:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:17:35,474 INFO L82 PathProgramCache]: Analyzing trace with hash -38529952, now seen corresponding path program 2 times
[2020-11-11 23:17:35,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:17:35,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147309576]
[2020-11-11 23:17:35,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:17:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-11-11 23:17:35,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-11-11 23:17:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-11-11 23:17:35,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-11-11 23:17:35,671 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-11-11 23:17:35,671 INFO L595 BasicCegarLoop]: Counterexample might be feasible
[2020-11-11 23:17:35,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-11-11 23:17:35,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 11:17:35 BasicIcfg
[2020-11-11 23:17:35,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-11-11 23:17:35,842 INFO L168 Benchmark]: Toolchain (without parser) took 17018.30 ms. Allocated memory was 312.5 MB in the beginning and 499.1 MB in the end (delta: 186.6 MB). Free memory was 287.4 MB in the beginning and 302.4 MB in the end (delta: -15.0 MB). Peak memory consumption was 174.4 MB. Max. memory is 16.0 GB.
[2020-11-11 23:17:35,842 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 312.5 MB. Free memory is still 282.5 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2020-11-11 23:17:35,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.55 ms. Allocated memory is still 312.5 MB. Free memory was 286.9 MB in the beginning and 290.1 MB in the end (delta: -3.3 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.0 GB.
[2020-11-11 23:17:35,845 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.59 ms. Allocated memory is still 312.5 MB. Free memory was 290.1 MB in the beginning and 288.1 MB in the end (delta: 2.0 MB). There was no memory consumed. Max. memory is 16.0 GB.
[2020-11-11 23:17:35,845 INFO L168 Benchmark]: Boogie Preprocessor took 69.56 ms. Allocated memory is still 312.5 MB. Free memory was 288.1 MB in the beginning and 285.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2020-11-11 23:17:35,847 INFO L168 Benchmark]: RCFGBuilder took 2019.65 ms. Allocated memory was 312.5 MB in the beginning and 375.4 MB in the end (delta: 62.9 MB). Free memory was 285.8 MB in the beginning and 338.3 MB in the end (delta: -52.5 MB). Peak memory consumption was 178.4 MB. Max. memory is 16.0 GB.
[2020-11-11 23:17:35,849 INFO L168 Benchmark]: TraceAbstraction took 13965.37 ms. Allocated memory was 375.4 MB in the beginning and 499.1 MB in the end (delta: 123.7 MB). Free memory was 338.3 MB in the beginning and 302.4 MB in the end (delta: 36.0 MB). Peak memory consumption was 159.7 MB. Max. memory is 16.0 GB.
[2020-11-11 23:17:35,857 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.18 ms. Allocated memory is still 312.5 MB. Free memory is still 282.5 MB. There was no memory consumed. Max. memory is 16.0 GB.
* CACSL2BoogieTranslator took 828.55 ms. Allocated memory is still 312.5 MB. Free memory was 286.9 MB in the beginning and 290.1 MB in the end (delta: -3.3 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.0 GB.
* Boogie Procedure Inliner took 122.59 ms. Allocated memory is still 312.5 MB. Free memory was 290.1 MB in the beginning and 288.1 MB in the end (delta: 2.0 MB). There was no memory consumed. Max. memory is 16.0 GB.
* Boogie Preprocessor took 69.56 ms. Allocated memory is still 312.5 MB. Free memory was 288.1 MB in the beginning and 285.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* RCFGBuilder took 2019.65 ms. Allocated memory was 312.5 MB in the beginning and 375.4 MB in the end (delta: 62.9 MB). Free memory was 285.8 MB in the beginning and 338.3 MB in the end (delta: -52.5 MB). Peak memory consumption was 178.4 MB. Max. memory is 16.0 GB.
* TraceAbstraction took 13965.37 ms. Allocated memory was 375.4 MB in the beginning and 499.1 MB in the end (delta: 123.7 MB). Free memory was 338.3 MB in the beginning and 302.4 MB in the end (delta: 36.0 MB). Peak memory consumption was 159.7 MB. Max. memory is 16.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
1839 VarBasedMoverChecksPositive, 60 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 43 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 220 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.6s, 131 PlacesBefore, 45 PlacesAfterwards, 121 TransitionsBefore, 33 TransitionsAfterwards, 2712 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 6772 MoverChecksTotal
- CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable
a call of __VERIFIER_error() is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p1_EAX = 0;
[L714] 0 int __unbuffered_p2_EAX = 0;
[L716] 0 int __unbuffered_p3_EAX = 0;
[L718] 0 int __unbuffered_p3_EBX = 0;
[L720] 0 int a = 0;
[L722] 0 int b = 0;
[L723] 0 _Bool main$tmp_guard0;
[L724] 0 _Bool main$tmp_guard1;
[L726] 0 int x = 0;
[L728] 0 int y = 0;
[L730] 0 int z = 0;
[L731] 0 _Bool z$flush_delayed;
[L732] 0 int z$mem_tmp;
[L733] 0 _Bool z$r_buff0_thd0;
[L734] 0 _Bool z$r_buff0_thd1;
[L735] 0 _Bool z$r_buff0_thd2;
[L736] 0 _Bool z$r_buff0_thd3;
[L737] 0 _Bool z$r_buff0_thd4;
[L738] 0 _Bool z$r_buff1_thd0;
[L739] 0 _Bool z$r_buff1_thd1;
[L740] 0 _Bool z$r_buff1_thd2;
[L741] 0 _Bool z$r_buff1_thd3;
[L742] 0 _Bool z$r_buff1_thd4;
[L743] 0 _Bool z$read_delayed;
[L744] 0 int *z$read_delayed_var;
[L745] 0 int z$w_buff0;
[L746] 0 _Bool z$w_buff0_used;
[L747] 0 int z$w_buff1;
[L748] 0 _Bool z$w_buff1_used;
[L749] 0 _Bool weak$$choice0;
[L750] 0 _Bool weak$$choice2;
[L856] 0 pthread_t t989;
[L857] FCALL, FORK 0 pthread_create(&t989, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L858] 0 pthread_t t990;
[L859] FCALL, FORK 0 pthread_create(&t990, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L860] 0 pthread_t t991;
[L861] FCALL, FORK 0 pthread_create(&t991, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L862] 0 pthread_t t992;
[L863] FCALL, FORK 0 pthread_create(&t992, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L812] 4 z$w_buff1 = z$w_buff0
[L813] 4 z$w_buff0 = 1
[L814] 4 z$w_buff1_used = z$w_buff0_used
[L815] 4 z$w_buff0_used = (_Bool)1
[L18] COND FALSE 4 !(!expression)
[L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0
[L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1
[L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2
[L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3
[L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4
[L822] 4 z$r_buff0_thd4 = (_Bool)1
[L825] 4 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L828] 4 __unbuffered_p3_EAX = a
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L831] 4 __unbuffered_p3_EBX = b
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L754] 1 b = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L757] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L764] 1 return 0;
[L769] 2 x = 2
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L772] 2 __unbuffered_p1_EAX = y
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L784] 3 y = 1
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L779] 2 return 0;
[L787] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L788] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L789] 3 z$flush_delayed = weak$$choice2
[L790] 3 z$mem_tmp = z
[L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L792] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)
[L792] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L793] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)
[L793] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L794] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)
[L794] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L795] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L795] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L796] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)
[L796] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L797] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L797] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L798] 3 __unbuffered_p2_EAX = z
[L799] EXPR 3 z$flush_delayed ? z$mem_tmp : z
[L799] 3 z = z$flush_delayed ? z$mem_tmp : z
[L800] 3 z$flush_delayed = (_Bool)0
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L807] 3 return 0;
[L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L836] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L837] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L838] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1
[L843] 4 return 0;
[L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4
[L3] COND FALSE 0 !(!cond)
[L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L869] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L871] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L872] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L873] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L18] COND TRUE 0 !expression
[L17] COND FALSE 0 !(0)
[L17] 0 __assert_fail ("0", "mix037_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.9s, HoareTripleCheckerStatistics: 429 SDtfs, 421 SDslu, 829 SDs, 0 SdLazy, 232 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2858occurred 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.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 130 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 11725 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...