/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/mix053_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-11 23:25:57,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-11 23:25:57,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-11 23:25:57,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-11 23:25:57,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-11 23:25:57,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-11 23:25:57,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-11 23:25:57,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-11 23:25:57,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-11 23:25:57,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-11 23:25:57,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-11 23:25:57,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-11 23:25:57,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-11 23:25:57,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-11 23:25:57,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-11 23:25:57,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-11 23:25:57,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-11 23:25:57,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-11 23:25:57,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-11 23:25:57,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-11 23:25:57,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-11 23:25:57,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-11 23:25:57,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-11 23:25:57,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-11 23:25:57,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-11 23:25:57,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-11 23:25:57,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-11 23:25:57,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-11 23:25:57,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-11 23:25:57,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-11 23:25:57,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-11 23:25:57,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-11 23:25:57,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-11 23:25:57,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-11 23:25:57,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-11 23:25:57,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-11 23:25:57,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-11 23:25:57,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-11 23:25:57,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-11 23:25:57,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-11 23:25:57,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-11 23:25:57,210 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:25:57,251 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-11 23:25:57,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-11 23:25:57,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-11 23:25:57,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-11 23:25:57,254 INFO L138 SettingsManager]: * Use SBE=true [2020-11-11 23:25:57,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-11 23:25:57,255 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-11 23:25:57,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-11 23:25:57,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-11 23:25:57,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-11 23:25:57,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-11 23:25:57,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-11 23:25:57,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-11 23:25:57,258 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-11 23:25:57,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-11 23:25:57,258 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-11 23:25:57,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-11 23:25:57,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-11 23:25:57,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-11 23:25:57,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-11 23:25:57,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-11 23:25:57,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-11 23:25:57,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-11 23:25:57,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-11 23:25:57,260 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-11 23:25:57,260 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-11 23:25:57,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-11 23:25:57,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-11 23:25:57,261 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:25:57,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-11 23:25:57,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-11 23:25:57,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-11 23:25:57,691 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-11 23:25:57,692 INFO L275 PluginConnector]: CDTParser initialized [2020-11-11 23:25:57,693 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_rmo.oepc.i [2020-11-11 23:25:57,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976ca789b/3a1628de925d4d3b8980b94c49ca9f17/FLAG7d8a25c70 [2020-11-11 23:25:58,500 INFO L306 CDTParser]: Found 1 translation units. [2020-11-11 23:25:58,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_rmo.oepc.i [2020-11-11 23:25:58,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976ca789b/3a1628de925d4d3b8980b94c49ca9f17/FLAG7d8a25c70 [2020-11-11 23:25:58,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976ca789b/3a1628de925d4d3b8980b94c49ca9f17 [2020-11-11 23:25:58,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-11 23:25:58,772 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-11 23:25:58,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-11 23:25:58,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-11 23:25:58,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-11 23:25:58,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:25:58" (1/1) ... [2020-11-11 23:25:58,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664324f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:25:58, skipping insertion in model container [2020-11-11 23:25:58,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:25:58" (1/1) ... [2020-11-11 23:25:58,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-11 23:25:58,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-11 23:25:59,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 23:25:59,344 INFO L203 MainTranslator]: Completed pre-run [2020-11-11 23:25:59,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 23:25:59,579 INFO L208 MainTranslator]: Completed translation [2020-11-11 23:25:59,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:25:59 WrapperNode [2020-11-11 23:25:59,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-11 23:25:59,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-11 23:25:59,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-11 23:25:59,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-11 23:25:59,590 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:25:59" (1/1) ... [2020-11-11 23:25:59,612 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:25:59" (1/1) ... [2020-11-11 23:25:59,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-11 23:25:59,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-11 23:25:59,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-11 23:25:59,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-11 23:25:59,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:25:59" (1/1) ... [2020-11-11 23:25:59,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:25:59" (1/1) ... [2020-11-11 23:25:59,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:25:59" (1/1) ... [2020-11-11 23:25:59,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:25:59" (1/1) ... [2020-11-11 23:25:59,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:25:59" (1/1) ... [2020-11-11 23:25:59,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:25:59" (1/1) ... [2020-11-11 23:25:59,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:25:59" (1/1) ... [2020-11-11 23:25:59,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-11 23:25:59,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-11 23:25:59,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-11 23:25:59,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-11 23:25:59,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:25:59" (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:25:59,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-11 23:25:59,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-11 23:25:59,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-11 23:25:59,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-11 23:25:59,797 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-11 23:25:59,797 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-11 23:25:59,798 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-11 23:25:59,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-11 23:25:59,800 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-11 23:25:59,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-11 23:25:59,803 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-11 23:25:59,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-11 23:25:59,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-11 23:25:59,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-11 23:25:59,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-11 23:25:59,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-11 23:25:59,806 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:26:02,508 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-11 23:26:02,508 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-11 23:26:02,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:26:02 BoogieIcfgContainer [2020-11-11 23:26:02,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-11 23:26:02,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-11 23:26:02,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-11 23:26:02,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-11 23:26:02,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:25:58" (1/3) ... [2020-11-11 23:26:02,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8123df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:26:02, skipping insertion in model container [2020-11-11 23:26:02,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:25:59" (2/3) ... [2020-11-11 23:26:02,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8123df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:26:02, skipping insertion in model container [2020-11-11 23:26:02,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:26:02" (3/3) ... [2020-11-11 23:26:02,520 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_rmo.oepc.i [2020-11-11 23:26:02,537 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-11 23:26:02,538 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-11 23:26:02,542 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-11 23:26:02,543 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-11 23:26:02,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,591 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,591 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,591 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,591 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,592 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,593 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,594 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,595 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,600 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,600 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,601 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,601 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,606 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,606 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,606 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,606 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,611 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,611 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,611 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,611 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,611 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,612 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,612 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,616 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,616 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,616 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,616 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,616 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,616 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,616 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,617 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,617 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,617 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,617 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,617 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,617 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,620 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,620 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,634 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,635 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,639 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,640 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,648 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,649 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,649 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,652 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,653 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:26:02,655 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-11 23:26:02,668 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-11 23:26:02,692 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-11 23:26:02,692 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-11 23:26:02,692 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-11 23:26:02,692 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-11 23:26:02,692 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-11 23:26:02,693 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-11 23:26:02,693 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-11 23:26:02,693 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-11 23:26:02,707 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-11 23:26:02,709 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 119 transitions, 258 flow [2020-11-11 23:26:02,713 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 119 transitions, 258 flow [2020-11-11 23:26:02,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 119 transitions, 258 flow [2020-11-11 23:26:02,772 INFO L129 PetriNetUnfolder]: 3/115 cut-off events. [2020-11-11 23:26:02,773 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-11 23:26:02,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 94 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-11 23:26:02,784 INFO L116 LiptonReduction]: Number of co-enabled transitions 2904 [2020-11-11 23:26:02,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:02,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:02,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:02,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:02,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:02,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:02,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:03,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:03,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:03,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:03,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:03,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:03,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:03,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:03,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:03,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:03,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:03,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:03,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:03,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:03,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:03,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:03,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:03,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:03,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:03,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:03,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:03,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:03,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:03,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:03,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:03,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:03,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:03,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:03,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-11 23:26:03,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:26:03,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:26:03,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:26:03,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-11 23:26:03,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:26:03,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-11 23:26:03,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:03,870 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:26:03,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:03,872 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:26:03,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:03,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:26:03,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-11 23:26:03,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-11 23:26:03,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:03,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:03,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:03,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:03,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:03,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:03,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:03,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:03,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:03,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:03,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:03,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:03,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:03,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:03,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:03,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:03,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:04,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:04,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:04,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:04,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:04,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:04,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:04,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:04,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:04,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:04,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:04,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:04,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:04,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:04,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:04,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:04,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:04,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:04,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:04,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:04,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:04,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:04,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:04,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:04,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:04,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:04,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:04,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:04,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:04,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:04,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:04,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:04,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:04,873 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-11 23:26:04,984 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-11-11 23:26:05,196 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2020-11-11 23:26:05,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:05,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:05,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:05,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:05,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:05,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:05,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:05,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:05,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:05,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:05,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:05,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:05,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:05,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:05,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:05,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:05,572 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-11 23:26:05,698 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-11 23:26:06,273 WARN L193 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-11-11 23:26:06,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-11 23:26:06,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:06,696 WARN L193 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-11-11 23:26:06,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:06,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:06,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:06,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:06,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:06,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:06,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:06,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:06,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:06,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:06,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:06,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:06,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:06,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:06,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:06,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:06,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:26:06,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:06,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:26:06,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:07,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:26:07,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:07,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-11 23:26:07,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:07,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:26:07,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:07,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-11 23:26:07,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:07,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:07,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:07,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:07,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:07,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:07,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:07,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:07,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:07,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:07,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:07,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:07,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:07,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:07,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:07,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:07,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:07,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:07,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:07,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:07,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:07,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:07,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:07,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:07,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:07,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:07,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:07,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:07,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:07,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:07,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:07,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:07,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:08,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-11 23:26:08,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:08,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:26:08,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:08,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-11 23:26:08,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:08,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:26:08,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:08,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:26:08,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:08,699 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-11 23:26:08,891 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-11 23:26:09,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:09,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:09,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:09,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:09,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:09,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:09,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:09,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:09,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:09,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:09,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:09,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:09,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:09,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:09,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:09,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:09,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:09,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:09,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:09,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:09,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:09,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:09,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:09,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:09,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:09,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:09,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:09,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:09,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:09,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:09,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:09,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:09,681 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-11 23:26:09,815 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-11 23:26:10,281 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-11-11 23:26:10,524 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-11 23:26:10,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:26:10,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:11,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:11,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:11,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:11,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:11,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:11,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:11,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:11,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:11,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:11,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:11,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:11,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:11,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:11,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:11,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:11,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:11,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:11,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:11,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:11,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:11,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:11,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:11,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:11,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:26:11,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:11,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:11,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:11,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:26:11,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:26:11,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:11,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:26:11,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:26:12,171 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-11-11 23:26:12,282 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-11-11 23:26:12,393 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-11-11 23:26:12,501 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-11-11 23:26:13,118 WARN L193 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-11-11 23:26:13,363 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-11 23:26:13,891 WARN L193 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-11-11 23:26:14,131 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-11 23:26:14,261 INFO L131 LiptonReduction]: Checked pairs total: 8446 [2020-11-11 23:26:14,262 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-11-11 23:26:14,273 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-11-11 23:26:14,623 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4124 states, 4120 states have (on average 4.147330097087378) internal successors, (17087), 4123 states have internal predecessors, (17087), 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:26:14,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 4124 states, 4120 states have (on average 4.147330097087378) internal successors, (17087), 4123 states have internal predecessors, (17087), 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:26:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-11 23:26:14,647 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:26:14,648 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-11 23:26:14,649 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:26:14,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:26:14,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1237069, now seen corresponding path program 1 times [2020-11-11 23:26:14,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:26:14,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042634724] [2020-11-11 23:26:14,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:26:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:26:14,914 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:26:14,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042634724] [2020-11-11 23:26:14,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:26:14,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-11 23:26:14,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97066891] [2020-11-11 23:26:14,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-11 23:26:14,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:26:14,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-11 23:26:14,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 23:26:14,977 INFO L87 Difference]: Start difference. First operand has 4124 states, 4120 states have (on average 4.147330097087378) internal successors, (17087), 4123 states have internal predecessors, (17087), 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 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:26:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:26:15,183 INFO L93 Difference]: Finished difference Result 3437 states and 13500 transitions. [2020-11-11 23:26:15,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-11 23:26:15,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2020-11-11 23:26:15,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:26:15,253 INFO L225 Difference]: With dead ends: 3437 [2020-11-11 23:26:15,253 INFO L226 Difference]: Without dead ends: 2812 [2020-11-11 23:26:15,255 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:26:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2020-11-11 23:26:15,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2812. [2020-11-11 23:26:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2811 states have (on average 3.8687299893276412) internal successors, (10875), 2811 states have internal predecessors, (10875), 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:26:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 10875 transitions. [2020-11-11 23:26:15,490 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 10875 transitions. Word has length 3 [2020-11-11 23:26:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:26:15,491 INFO L481 AbstractCegarLoop]: Abstraction has 2812 states and 10875 transitions. [2020-11-11 23:26:15,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:26:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 10875 transitions. [2020-11-11 23:26:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-11 23:26:15,494 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:26:15,495 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:26:15,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-11 23:26:15,495 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:26:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:26:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash -99649879, now seen corresponding path program 1 times [2020-11-11 23:26:15,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:26:15,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931660156] [2020-11-11 23:26:15,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:26:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:26:15,623 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:26:15,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931660156] [2020-11-11 23:26:15,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:26:15,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-11 23:26:15,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45067998] [2020-11-11 23:26:15,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-11 23:26:15,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:26:15,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-11 23:26:15,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 23:26:15,626 INFO L87 Difference]: Start difference. First operand 2812 states and 10875 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:26:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:26:15,672 INFO L93 Difference]: Finished difference Result 2762 states and 10645 transitions. [2020-11-11 23:26:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-11 23:26:15,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2020-11-11 23:26:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:26:15,702 INFO L225 Difference]: With dead ends: 2762 [2020-11-11 23:26:15,702 INFO L226 Difference]: Without dead ends: 2762 [2020-11-11 23:26:15,703 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:26:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2020-11-11 23:26:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2762. [2020-11-11 23:26:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 2761 states have (on average 3.855487142339732) internal successors, (10645), 2761 states have internal predecessors, (10645), 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:26:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 10645 transitions. [2020-11-11 23:26:15,871 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 10645 transitions. Word has length 11 [2020-11-11 23:26:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:26:15,872 INFO L481 AbstractCegarLoop]: Abstraction has 2762 states and 10645 transitions. [2020-11-11 23:26:15,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:26:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 10645 transitions. [2020-11-11 23:26:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-11 23:26:15,881 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:26:15,881 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:26:15,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-11 23:26:15,881 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:26:15,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:26:15,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1205820487, now seen corresponding path program 1 times [2020-11-11 23:26:15,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:26:15,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450817197] [2020-11-11 23:26:15,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:26:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:26:16,023 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:26:16,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450817197] [2020-11-11 23:26:16,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:26:16,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-11 23:26:16,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941504501] [2020-11-11 23:26:16,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-11 23:26:16,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:26:16,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-11 23:26:16,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 23:26:16,026 INFO L87 Difference]: Start difference. First operand 2762 states and 10645 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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:26:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:26:16,075 INFO L93 Difference]: Finished difference Result 2722 states and 10463 transitions. [2020-11-11 23:26:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-11 23:26:16,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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:26:16,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:26:16,102 INFO L225 Difference]: With dead ends: 2722 [2020-11-11 23:26:16,102 INFO L226 Difference]: Without dead ends: 2722 [2020-11-11 23:26:16,102 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:26:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2020-11-11 23:26:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2722. [2020-11-11 23:26:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2721 states have (on average 3.845277471517824) internal successors, (10463), 2721 states have internal predecessors, (10463), 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:26:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 10463 transitions. [2020-11-11 23:26:16,232 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 10463 transitions. Word has length 12 [2020-11-11 23:26:16,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:26:16,232 INFO L481 AbstractCegarLoop]: Abstraction has 2722 states and 10463 transitions. [2020-11-11 23:26:16,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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:26:16,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 10463 transitions. [2020-11-11 23:26:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-11 23:26:16,234 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:26:16,235 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:26:16,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-11 23:26:16,235 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:26:16,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:26:16,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1088751128, now seen corresponding path program 1 times [2020-11-11 23:26:16,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:26:16,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788390356] [2020-11-11 23:26:16,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:26:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:26:16,335 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:26:16,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788390356] [2020-11-11 23:26:16,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:26:16,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 23:26:16,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665803188] [2020-11-11 23:26:16,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-11 23:26:16,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:26:16,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-11 23:26:16,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 23:26:16,339 INFO L87 Difference]: Start difference. First operand 2722 states and 10463 transitions. Second operand has 3 states, 2 states have (on average 6.5) 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:26:16,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:26:16,390 INFO L93 Difference]: Finished difference Result 3967 states and 14749 transitions. [2020-11-11 23:26:16,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-11 23:26:16,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) 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:26:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:26:16,421 INFO L225 Difference]: With dead ends: 3967 [2020-11-11 23:26:16,421 INFO L226 Difference]: Without dead ends: 2947 [2020-11-11 23:26:16,421 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 23:26:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-11-11 23:26:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 2647. [2020-11-11 23:26:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2647 states, 2646 states have (on average 3.7048374905517765) internal successors, (9803), 2646 states have internal predecessors, (9803), 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:26:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 9803 transitions. [2020-11-11 23:26:16,640 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 9803 transitions. Word has length 13 [2020-11-11 23:26:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:26:16,641 INFO L481 AbstractCegarLoop]: Abstraction has 2647 states and 9803 transitions. [2020-11-11 23:26:16,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 6.5) 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:26:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 9803 transitions. [2020-11-11 23:26:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-11 23:26:16,645 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:26:16,645 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:26:16,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-11 23:26:16,645 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:26:16,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:26:16,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1715651140, now seen corresponding path program 1 times [2020-11-11 23:26:16,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:26:16,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476848264] [2020-11-11 23:26:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:26:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:26:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:26:16,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476848264] [2020-11-11 23:26:16,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:26:16,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-11 23:26:16,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64274605] [2020-11-11 23:26:16,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:26:16,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:26:16,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:26:16,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:26:16,763 INFO L87 Difference]: Start difference. First operand 2647 states and 9803 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:26:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:26:16,822 INFO L93 Difference]: Finished difference Result 2592 states and 8655 transitions. [2020-11-11 23:26:16,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-11 23:26:16,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2020-11-11 23:26:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:26:16,840 INFO L225 Difference]: With dead ends: 2592 [2020-11-11 23:26:16,841 INFO L226 Difference]: Without dead ends: 1967 [2020-11-11 23:26:16,841 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:26:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2020-11-11 23:26:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1967. [2020-11-11 23:26:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1966 states have (on average 3.3056968463886065) internal successors, (6499), 1966 states have internal predecessors, (6499), 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:26:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 6499 transitions. [2020-11-11 23:26:16,929 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 6499 transitions. Word has length 13 [2020-11-11 23:26:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:26:16,930 INFO L481 AbstractCegarLoop]: Abstraction has 1967 states and 6499 transitions. [2020-11-11 23:26:16,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:26:16,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 6499 transitions. [2020-11-11 23:26:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-11 23:26:16,933 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:26:16,934 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:26:16,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-11 23:26:16,934 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:26:16,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:26:16,934 INFO L82 PathProgramCache]: Analyzing trace with hash -294712152, now seen corresponding path program 1 times [2020-11-11 23:26:16,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:26:16,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23842844] [2020-11-11 23:26:16,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:26:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:26:17,082 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:26:17,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23842844] [2020-11-11 23:26:17,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:26:17,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-11 23:26:17,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306809414] [2020-11-11 23:26:17,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-11 23:26:17,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:26:17,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-11 23:26:17,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:26:17,085 INFO L87 Difference]: Start difference. First operand 1967 states and 6499 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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:26:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:26:17,149 INFO L93 Difference]: Finished difference Result 1630 states and 4935 transitions. [2020-11-11 23:26:17,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:26:17,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2020-11-11 23:26:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:26:17,155 INFO L225 Difference]: With dead ends: 1630 [2020-11-11 23:26:17,156 INFO L226 Difference]: Without dead ends: 1261 [2020-11-11 23:26:17,156 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:26:17,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2020-11-11 23:26:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1261. [2020-11-11 23:26:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1260 states have (on average 2.9801587301587302) internal successors, (3755), 1260 states have internal predecessors, (3755), 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:26:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 3755 transitions. [2020-11-11 23:26:17,199 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 3755 transitions. Word has length 16 [2020-11-11 23:26:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:26:17,199 INFO L481 AbstractCegarLoop]: Abstraction has 1261 states and 3755 transitions. [2020-11-11 23:26:17,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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:26:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 3755 transitions. [2020-11-11 23:26:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-11 23:26:17,202 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:26:17,203 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:26:17,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-11 23:26:17,203 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:26:17,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:26:17,203 INFO L82 PathProgramCache]: Analyzing trace with hash 616991812, now seen corresponding path program 1 times [2020-11-11 23:26:17,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:26:17,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062779386] [2020-11-11 23:26:17,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:26:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:26:17,296 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:26:17,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062779386] [2020-11-11 23:26:17,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:26:17,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-11 23:26:17,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843491366] [2020-11-11 23:26:17,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 23:26:17,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:26:17,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 23:26:17,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-11 23:26:17,298 INFO L87 Difference]: Start difference. First operand 1261 states and 3755 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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:26:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:26:17,368 INFO L93 Difference]: Finished difference Result 1100 states and 3247 transitions. [2020-11-11 23:26:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 23:26:17,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2020-11-11 23:26:17,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:26:17,373 INFO L225 Difference]: With dead ends: 1100 [2020-11-11 23:26:17,374 INFO L226 Difference]: Without dead ends: 987 [2020-11-11 23:26:17,374 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-11 23:26:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2020-11-11 23:26:17,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 987. [2020-11-11 23:26:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 986 states have (on average 2.9969574036511157) internal successors, (2955), 986 states have internal predecessors, (2955), 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:26:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 2955 transitions. [2020-11-11 23:26:17,406 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 2955 transitions. Word has length 19 [2020-11-11 23:26:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:26:17,406 INFO L481 AbstractCegarLoop]: Abstraction has 987 states and 2955 transitions. [2020-11-11 23:26:17,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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:26:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 2955 transitions. [2020-11-11 23:26:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-11 23:26:17,409 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:26:17,410 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:26:17,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-11 23:26:17,410 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:26:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:26:17,410 INFO L82 PathProgramCache]: Analyzing trace with hash 962869753, now seen corresponding path program 1 times [2020-11-11 23:26:17,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:26:17,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434766792] [2020-11-11 23:26:17,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:26:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:26:17,502 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:26:17,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434766792] [2020-11-11 23:26:17,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:26:17,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 23:26:17,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248868275] [2020-11-11 23:26:17,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-11 23:26:17,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:26:17,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-11 23:26:17,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 23:26:17,504 INFO L87 Difference]: Start difference. First operand 987 states and 2955 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:26:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:26:17,526 INFO L93 Difference]: Finished difference Result 1461 states and 4272 transitions. [2020-11-11 23:26:17,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-11 23:26:17,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:26:17,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:26:17,530 INFO L225 Difference]: With dead ends: 1461 [2020-11-11 23:26:17,530 INFO L226 Difference]: Without dead ends: 933 [2020-11-11 23:26:17,531 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 23:26:17,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2020-11-11 23:26:17,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 930. [2020-11-11 23:26:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 2.8148546824542517) internal successors, (2615), 929 states have internal predecessors, (2615), 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:26:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 2615 transitions. [2020-11-11 23:26:17,562 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 2615 transitions. Word has length 23 [2020-11-11 23:26:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:26:17,563 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 2615 transitions. [2020-11-11 23:26:17,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:26:17,563 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 2615 transitions. [2020-11-11 23:26:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-11 23:26:17,566 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:26:17,566 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:26:17,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-11 23:26:17,566 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:26:17,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:26:17,566 INFO L82 PathProgramCache]: Analyzing trace with hash -178639278, now seen corresponding path program 1 times [2020-11-11 23:26:17,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:26:17,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373749764] [2020-11-11 23:26:17,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:26:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:26:17,642 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:26:17,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373749764] [2020-11-11 23:26:17,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:26:17,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-11 23:26:17,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619839169] [2020-11-11 23:26:17,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:26:17,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:26:17,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:26:17,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:26:17,644 INFO L87 Difference]: Start difference. First operand 930 states and 2615 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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:26:17,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:26:17,668 INFO L93 Difference]: Finished difference Result 1237 states and 3394 transitions. [2020-11-11 23:26:17,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-11 23:26:17,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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:26:17,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:26:17,671 INFO L225 Difference]: With dead ends: 1237 [2020-11-11 23:26:17,671 INFO L226 Difference]: Without dead ends: 845 [2020-11-11 23:26:17,671 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:26:17,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2020-11-11 23:26:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 842. [2020-11-11 23:26:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 2.6932223543400715) internal successors, (2265), 841 states have internal predecessors, (2265), 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:26:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2265 transitions. [2020-11-11 23:26:17,700 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 2265 transitions. Word has length 23 [2020-11-11 23:26:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:26:17,702 INFO L481 AbstractCegarLoop]: Abstraction has 842 states and 2265 transitions. [2020-11-11 23:26:17,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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:26:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 2265 transitions. [2020-11-11 23:26:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-11 23:26:17,707 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:26:17,707 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:26:17,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-11 23:26:17,708 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:26:17,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:26:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1280743086, now seen corresponding path program 2 times [2020-11-11 23:26:17,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:26:17,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577541204] [2020-11-11 23:26:17,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:26:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:26:17,899 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:26:17,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577541204] [2020-11-11 23:26:17,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:26:17,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 23:26:17,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760135359] [2020-11-11 23:26:17,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-11 23:26:17,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:26:17,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-11 23:26:17,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:26:17,901 INFO L87 Difference]: Start difference. First operand 842 states and 2265 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:26:17,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:26:17,994 INFO L93 Difference]: Finished difference Result 813 states and 2208 transitions. [2020-11-11 23:26:17,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-11 23:26:17,995 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:26:17,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:26:17,996 INFO L225 Difference]: With dead ends: 813 [2020-11-11 23:26:17,996 INFO L226 Difference]: Without dead ends: 316 [2020-11-11 23:26:17,997 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-11-11 23:26:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-11-11 23:26:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2020-11-11 23:26:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 2.726984126984127) internal successors, (859), 315 states have internal predecessors, (859), 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:26:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 859 transitions. [2020-11-11 23:26:18,006 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 859 transitions. Word has length 23 [2020-11-11 23:26:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:26:18,006 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 859 transitions. [2020-11-11 23:26:18,006 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:26:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 859 transitions. [2020-11-11 23:26:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-11 23:26:18,008 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:26:18,008 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, 1] [2020-11-11 23:26:18,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-11 23:26:18,008 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:26:18,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:26:18,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2025753151, now seen corresponding path program 1 times [2020-11-11 23:26:18,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:26:18,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698157407] [2020-11-11 23:26:18,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:26:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:26:18,300 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:26:18,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698157407] [2020-11-11 23:26:18,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:26:18,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-11 23:26:18,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205061526] [2020-11-11 23:26:18,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-11 23:26:18,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:26:18,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-11 23:26:18,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:26:18,302 INFO L87 Difference]: Start difference. First operand 316 states and 859 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:26:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:26:18,579 INFO L93 Difference]: Finished difference Result 519 states and 1371 transitions. [2020-11-11 23:26:18,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 23:26:18,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 27 [2020-11-11 23:26:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:26:18,582 INFO L225 Difference]: With dead ends: 519 [2020-11-11 23:26:18,582 INFO L226 Difference]: Without dead ends: 319 [2020-11-11 23:26:18,583 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-11-11 23:26:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-11-11 23:26:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 268. [2020-11-11 23:26:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 2.647940074906367) internal successors, (707), 267 states have internal predecessors, (707), 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:26:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 707 transitions. [2020-11-11 23:26:18,592 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 707 transitions. Word has length 27 [2020-11-11 23:26:18,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:26:18,592 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 707 transitions. [2020-11-11 23:26:18,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:26:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 707 transitions. [2020-11-11 23:26:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-11 23:26:18,594 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:26:18,594 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, 1] [2020-11-11 23:26:18,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-11 23:26:18,595 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:26:18,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:26:18,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1936802499, now seen corresponding path program 2 times [2020-11-11 23:26:18,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:26:18,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24335940] [2020-11-11 23:26:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:26:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:26:18,824 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:26:18,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24335940] [2020-11-11 23:26:18,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:26:18,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-11 23:26:18,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681013944] [2020-11-11 23:26:18,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-11 23:26:18,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:26:18,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-11 23:26:18,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:26:18,827 INFO L87 Difference]: Start difference. First operand 268 states and 707 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:26:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:26:19,007 INFO L93 Difference]: Finished difference Result 318 states and 825 transitions. [2020-11-11 23:26:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-11 23:26:19,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 27 [2020-11-11 23:26:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:26:19,009 INFO L225 Difference]: With dead ends: 318 [2020-11-11 23:26:19,010 INFO L226 Difference]: Without dead ends: 280 [2020-11-11 23:26:19,010 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-11 23:26:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-11-11 23:26:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 268. [2020-11-11 23:26:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 2.6329588014981273) internal successors, (703), 267 states have internal predecessors, (703), 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:26:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 703 transitions. [2020-11-11 23:26:19,019 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 703 transitions. Word has length 27 [2020-11-11 23:26:19,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:26:19,019 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 703 transitions. [2020-11-11 23:26:19,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:26:19,019 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 703 transitions. [2020-11-11 23:26:19,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-11 23:26:19,022 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:26:19,022 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, 1] [2020-11-11 23:26:19,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-11 23:26:19,022 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:26:19,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:26:19,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1708152179, now seen corresponding path program 3 times [2020-11-11 23:26:19,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:26:19,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749277572] [2020-11-11 23:26:19,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:26:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:26:19,238 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:26:19,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749277572] [2020-11-11 23:26:19,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:26:19,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 23:26:19,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125365355] [2020-11-11 23:26:19,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-11 23:26:19,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:26:19,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-11 23:26:19,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-11 23:26:19,240 INFO L87 Difference]: Start difference. First operand 268 states and 703 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:26:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:26:19,486 INFO L93 Difference]: Finished difference Result 400 states and 1009 transitions. [2020-11-11 23:26:19,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-11 23:26:19,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 27 [2020-11-11 23:26:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:26:19,488 INFO L225 Difference]: With dead ends: 400 [2020-11-11 23:26:19,488 INFO L226 Difference]: Without dead ends: 257 [2020-11-11 23:26:19,488 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-11 23:26:19,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-11-11 23:26:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 220. [2020-11-11 23:26:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.442922374429224) internal successors, (535), 219 states have internal predecessors, (535), 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:26:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 535 transitions. [2020-11-11 23:26:19,495 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 535 transitions. Word has length 27 [2020-11-11 23:26:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:26:19,495 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 535 transitions. [2020-11-11 23:26:19,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:26:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 535 transitions. [2020-11-11 23:26:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-11 23:26:19,497 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:26:19,498 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, 1] [2020-11-11 23:26:19,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-11 23:26:19,498 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:26:19,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:26:19,498 INFO L82 PathProgramCache]: Analyzing trace with hash -705593089, now seen corresponding path program 4 times [2020-11-11 23:26:19,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:26:19,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432960609] [2020-11-11 23:26:19,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:26:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 23:26:19,581 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 23:26:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 23:26:19,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 23:26:19,807 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-11 23:26:19,808 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-11 23:26:19,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-11 23:26:19,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 11:26:19 BasicIcfg [2020-11-11 23:26:19,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-11 23:26:19,972 INFO L168 Benchmark]: Toolchain (without parser) took 21204.84 ms. Allocated memory was 302.0 MB in the beginning and 536.9 MB in the end (delta: 234.9 MB). Free memory was 278.5 MB in the beginning and 312.4 MB in the end (delta: -33.9 MB). Peak memory consumption was 201.0 MB. Max. memory is 16.0 GB. [2020-11-11 23:26:19,973 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.0 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-11 23:26:19,973 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.92 ms. Allocated memory is still 302.0 MB. Free memory was 277.7 MB in the beginning and 263.1 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2020-11-11 23:26:19,974 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.32 ms. Allocated memory is still 302.0 MB. Free memory was 263.1 MB in the beginning and 260.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-11 23:26:19,974 INFO L168 Benchmark]: Boogie Preprocessor took 49.59 ms. Allocated memory is still 302.0 MB. Free memory was 260.5 MB in the beginning and 258.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-11 23:26:19,978 INFO L168 Benchmark]: RCFGBuilder took 2813.68 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 258.0 MB in the beginning and 278.6 MB in the end (delta: -20.6 MB). Peak memory consumption was 158.4 MB. Max. memory is 16.0 GB. [2020-11-11 23:26:19,979 INFO L168 Benchmark]: TraceAbstraction took 17458.70 ms. Allocated memory was 362.8 MB in the beginning and 536.9 MB in the end (delta: 174.1 MB). Free memory was 277.6 MB in the beginning and 312.4 MB in the end (delta: -34.8 MB). Peak memory consumption was 139.3 MB. Max. memory is 16.0 GB. [2020-11-11 23:26:19,983 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.20 ms. Allocated memory is still 302.0 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 805.92 ms. Allocated memory is still 302.0 MB. Free memory was 277.7 MB in the beginning and 263.1 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 65.32 ms. Allocated memory is still 302.0 MB. Free memory was 263.1 MB in the beginning and 260.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 49.59 ms. Allocated memory is still 302.0 MB. Free memory was 260.5 MB in the beginning and 258.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2813.68 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 258.0 MB in the beginning and 278.6 MB in the end (delta: -20.6 MB). Peak memory consumption was 158.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17458.70 ms. Allocated memory was 362.8 MB in the beginning and 536.9 MB in the end (delta: 174.1 MB). Free memory was 277.6 MB in the beginning and 312.4 MB in the end (delta: -34.8 MB). Peak memory consumption was 139.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2105 VarBasedMoverChecksPositive, 115 VarBasedMoverChecksNegative, 38 SemBasedMoverChecksPositive, 77 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 257 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.5s, 129 PlacesBefore, 46 PlacesAfterwards, 119 TransitionsBefore, 34 TransitionsAfterwards, 2904 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, 8446 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1425; [L860] FCALL, FORK 0 pthread_create(&t1425, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1426; [L862] FCALL, FORK 0 pthread_create(&t1426, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1427; [L864] FCALL, FORK 0 pthread_create(&t1427, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1428; [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t1428, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L798] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L818] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L826] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L826] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L827] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L827] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L828] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L828] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L829] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L830] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L830] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L831] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L3] COND FALSE 0 !(!cond) [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L879] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix053_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.9s, HoareTripleCheckerStatistics: 426 SDtfs, 666 SDslu, 694 SDs, 0 SdLazy, 262 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4124occurred 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.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 406 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 28162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...