/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/mix047_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-11 23:22:52,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-11 23:22:52,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-11 23:22:52,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-11 23:22:52,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-11 23:22:52,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-11 23:22:52,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-11 23:22:52,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-11 23:22:52,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-11 23:22:52,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-11 23:22:52,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-11 23:22:52,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-11 23:22:52,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-11 23:22:52,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-11 23:22:52,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-11 23:22:52,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-11 23:22:52,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-11 23:22:52,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-11 23:22:52,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-11 23:22:52,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-11 23:22:52,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-11 23:22:52,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-11 23:22:52,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-11 23:22:52,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-11 23:22:52,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-11 23:22:52,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-11 23:22:52,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-11 23:22:52,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-11 23:22:52,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-11 23:22:52,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-11 23:22:52,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-11 23:22:52,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-11 23:22:52,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-11 23:22:52,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-11 23:22:52,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-11 23:22:52,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-11 23:22:52,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-11 23:22:52,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-11 23:22:52,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-11 23:22:52,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-11 23:22:52,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-11 23:22:52,549 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:22:52,603 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-11 23:22:52,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-11 23:22:52,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-11 23:22:52,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-11 23:22:52,609 INFO L138 SettingsManager]: * Use SBE=true [2020-11-11 23:22:52,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-11 23:22:52,610 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-11 23:22:52,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-11 23:22:52,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-11 23:22:52,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-11 23:22:52,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-11 23:22:52,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-11 23:22:52,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-11 23:22:52,612 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-11 23:22:52,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-11 23:22:52,613 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-11 23:22:52,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-11 23:22:52,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-11 23:22:52,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-11 23:22:52,614 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-11 23:22:52,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-11 23:22:52,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-11 23:22:52,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-11 23:22:52,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-11 23:22:52,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-11 23:22:52,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-11 23:22:52,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-11 23:22:52,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-11 23:22:52,616 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:22:53,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-11 23:22:53,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-11 23:22:53,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-11 23:22:53,050 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-11 23:22:53,050 INFO L275 PluginConnector]: CDTParser initialized [2020-11-11 23:22:53,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.oepc.i [2020-11-11 23:22:53,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bd2e291f/1031b711d1a0473298f2f447648158c8/FLAG948cdc59d [2020-11-11 23:22:53,877 INFO L306 CDTParser]: Found 1 translation units. [2020-11-11 23:22:53,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.oepc.i [2020-11-11 23:22:53,902 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bd2e291f/1031b711d1a0473298f2f447648158c8/FLAG948cdc59d [2020-11-11 23:22:54,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bd2e291f/1031b711d1a0473298f2f447648158c8 [2020-11-11 23:22:54,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-11 23:22:54,142 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-11 23:22:54,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-11 23:22:54,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-11 23:22:54,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-11 23:22:54,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:22:54" (1/1) ... [2020-11-11 23:22:54,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f17edf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:22:54, skipping insertion in model container [2020-11-11 23:22:54,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:22:54" (1/1) ... [2020-11-11 23:22:54,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-11 23:22:54,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-11 23:22:54,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 23:22:54,709 INFO L203 MainTranslator]: Completed pre-run [2020-11-11 23:22:54,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 23:22:54,941 INFO L208 MainTranslator]: Completed translation [2020-11-11 23:22:54,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:22:54 WrapperNode [2020-11-11 23:22:54,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-11 23:22:54,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-11 23:22:54,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-11 23:22:54,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-11 23:22:54,961 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:22:54" (1/1) ... [2020-11-11 23:22:54,983 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:22:54" (1/1) ... [2020-11-11 23:22:55,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-11 23:22:55,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-11 23:22:55,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-11 23:22:55,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-11 23:22:55,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:22:54" (1/1) ... [2020-11-11 23:22:55,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:22:54" (1/1) ... [2020-11-11 23:22:55,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:22:54" (1/1) ... [2020-11-11 23:22:55,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:22:54" (1/1) ... [2020-11-11 23:22:55,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:22:54" (1/1) ... [2020-11-11 23:22:55,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:22:54" (1/1) ... [2020-11-11 23:22:55,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:22:54" (1/1) ... [2020-11-11 23:22:55,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-11 23:22:55,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-11 23:22:55,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-11 23:22:55,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-11 23:22:55,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:22:54" (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:22:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-11 23:22:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-11 23:22:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-11 23:22:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-11 23:22:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-11 23:22:55,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-11 23:22:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-11 23:22:55,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-11 23:22:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-11 23:22:55,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-11 23:22:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-11 23:22:55,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-11 23:22:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-11 23:22:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-11 23:22:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-11 23:22:55,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-11 23:22:55,226 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:22:58,715 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-11 23:22:58,716 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-11 23:22:58,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:22:58 BoogieIcfgContainer [2020-11-11 23:22:58,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-11 23:22:58,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-11 23:22:58,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-11 23:22:58,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-11 23:22:58,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:22:54" (1/3) ... [2020-11-11 23:22:58,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64207b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:22:58, skipping insertion in model container [2020-11-11 23:22:58,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:22:54" (2/3) ... [2020-11-11 23:22:58,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64207b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:22:58, skipping insertion in model container [2020-11-11 23:22:58,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:22:58" (3/3) ... [2020-11-11 23:22:58,728 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_rmo.oepc.i [2020-11-11 23:22:58,745 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-11 23:22:58,746 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-11 23:22:58,750 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-11 23:22:58,751 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-11 23:22:58,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,814 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:22:58,814 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:22:58,815 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,815 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:22:58,815 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:22:58,815 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,816 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:22:58,816 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:22:58,816 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:22:58,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,816 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:22:58,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,817 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:22:58,817 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:22:58,817 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:22:58,817 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,818 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:22:58,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,824 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,828 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,828 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,829 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,829 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,834 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,834 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,835 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,835 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,844 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,844 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,845 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,845 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,845 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,845 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,845 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,845 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,845 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,850 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,850 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,861 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,867 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,867 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,868 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,868 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,868 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,868 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,868 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,868 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,869 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,873 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,873 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,873 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,875 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:22:58,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,876 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,877 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:22:58,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,877 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,877 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,881 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,881 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:22:58,884 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-11 23:22:58,898 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-11 23:22:58,922 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-11 23:22:58,922 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-11 23:22:58,922 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-11 23:22:58,922 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-11 23:22:58,923 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-11 23:22:58,923 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-11 23:22:58,923 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-11 23:22:58,923 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-11 23:22:58,937 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-11 23:22:58,939 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 122 transitions, 264 flow [2020-11-11 23:22:58,942 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 122 transitions, 264 flow [2020-11-11 23:22:58,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 122 transitions, 264 flow [2020-11-11 23:22:59,001 INFO L129 PetriNetUnfolder]: 3/118 cut-off events. [2020-11-11 23:22:59,001 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-11 23:22:59,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2020-11-11 23:22:59,011 INFO L116 LiptonReduction]: Number of co-enabled transitions 3124 [2020-11-11 23:22:59,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:22:59,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:22:59,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:22:59,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:22:59,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:22:59,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:22:59,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:22:59,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:22:59,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:22:59,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:22:59,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:22:59,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:22:59,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:22:59,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:22:59,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:22:59,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:00,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:00,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:00,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:00,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:23:00,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:00,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:00,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:00,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:00,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:00,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:00,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:00,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:00,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:00,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:00,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:00,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:00,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:00,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:00,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:00,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:00,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:00,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:00,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:00,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:00,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-11 23:23:00,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:23:00,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:23:00,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:23:00,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-11 23:23:00,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:23:00,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-11 23:23:00,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:23:00,671 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:23:00,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:23:00,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:23:00,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:23:00,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:23:00,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-11 23:23:00,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-11 23:23:00,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:23:00,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:00,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:00,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:00,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:00,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:00,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:00,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:00,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:00,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:00,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:00,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:00,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:01,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:01,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:01,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:01,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:01,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:01,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:01,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:01,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:01,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:01,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:01,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:01,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:01,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:01,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:01,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:01,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:01,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:01,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:01,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:01,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:01,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:01,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:01,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:01,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:01,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:01,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:01,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:01,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:01,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:23:01,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:01,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:01,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:02,197 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-11 23:23:02,430 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-11-11 23:23:02,664 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2020-11-11 23:23:02,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:02,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:02,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:02,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:02,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:02,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:02,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:02,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:02,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:02,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:02,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:02,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:02,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:02,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:02,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:02,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:03,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-11 23:23:03,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:23:03,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:23:03,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:23:03,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-11 23:23:03,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:23:03,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:23:03,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:03,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:23:03,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:04,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:23:04,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:04,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-11 23:23:04,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:23:04,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:23:04,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:23:04,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-11 23:23:04,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:23:04,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:23:04,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:05,970 WARN L193 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-11-11 23:23:06,148 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-11 23:23:07,043 WARN L193 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 91 [2020-11-11 23:23:07,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-11 23:23:07,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:07,795 WARN L193 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2020-11-11 23:23:08,097 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-11-11 23:23:08,468 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-11 23:23:08,721 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-11 23:23:09,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:23:09,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:09,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:23:09,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:09,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:23:09,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:09,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:09,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:09,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:09,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:09,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:09,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:23:09,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:09,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:23:09,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:09,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:09,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:09,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:09,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:09,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:09,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:09,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:09,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:09,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:09,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:09,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:09,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:09,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:09,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:09,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:23:09,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:09,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:09,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:09,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:23:09,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:23:09,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:23:09,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:23:09,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:23:10,842 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-11-11 23:23:11,009 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-11-11 23:23:11,181 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-11-11 23:23:11,380 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-11-11 23:23:11,549 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-11-11 23:23:11,692 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-11-11 23:23:11,835 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-11-11 23:23:11,982 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-11-11 23:23:12,922 WARN L193 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-11 23:23:13,346 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-11 23:23:14,227 WARN L193 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-11 23:23:14,663 WARN L193 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-11 23:23:14,694 INFO L131 LiptonReduction]: Checked pairs total: 8870 [2020-11-11 23:23:14,694 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-11-11 23:23:14,702 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2020-11-11 23:23:15,197 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5774 states, 5770 states have (on average 4.203119584055459) internal successors, (24252), 5773 states have internal predecessors, (24252), 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:23:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 5774 states, 5770 states have (on average 4.203119584055459) internal successors, (24252), 5773 states have internal predecessors, (24252), 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:23:15,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-11 23:23:15,230 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:15,231 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-11 23:23:15,231 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:23:15,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:15,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1248857, now seen corresponding path program 1 times [2020-11-11 23:23:15,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:15,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508885416] [2020-11-11 23:23:15,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:15,593 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:23:15,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508885416] [2020-11-11 23:23:15,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:15,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-11 23:23:15,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465947229] [2020-11-11 23:23:15,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-11 23:23:15,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:15,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-11 23:23:15,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 23:23:15,644 INFO L87 Difference]: Start difference. First operand has 5774 states, 5770 states have (on average 4.203119584055459) internal successors, (24252), 5773 states have internal predecessors, (24252), 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:23:15,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:15,819 INFO L93 Difference]: Finished difference Result 4812 states and 19300 transitions. [2020-11-11 23:23:15,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-11 23:23:15,822 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:23:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:15,888 INFO L225 Difference]: With dead ends: 4812 [2020-11-11 23:23:15,888 INFO L226 Difference]: Without dead ends: 4062 [2020-11-11 23:23:15,889 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:23:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2020-11-11 23:23:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2020-11-11 23:23:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4061 states have (on average 3.9706968726914553) internal successors, (16125), 4061 states have internal predecessors, (16125), 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:23:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2020-11-11 23:23:16,237 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 3 [2020-11-11 23:23:16,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:16,238 INFO L481 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2020-11-11 23:23:16,238 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:23:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2020-11-11 23:23:16,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-11 23:23:16,250 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:16,250 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:23:16,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-11 23:23:16,251 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:23:16,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:16,255 INFO L82 PathProgramCache]: Analyzing trace with hash -708821715, now seen corresponding path program 1 times [2020-11-11 23:23:16,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:16,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41499259] [2020-11-11 23:23:16,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:16,469 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:23:16,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41499259] [2020-11-11 23:23:16,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:16,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 23:23:16,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589235085] [2020-11-11 23:23:16,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:23:16,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:16,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:23:16,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:23:16,473 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:23:16,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:16,570 INFO L93 Difference]: Finished difference Result 4692 states and 18054 transitions. [2020-11-11 23:23:16,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:23:16,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2020-11-11 23:23:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:16,610 INFO L225 Difference]: With dead ends: 4692 [2020-11-11 23:23:16,610 INFO L226 Difference]: Without dead ends: 3942 [2020-11-11 23:23:16,611 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:23:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2020-11-11 23:23:16,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 3942. [2020-11-11 23:23:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3941 states have (on average 3.950520172545039) internal successors, (15569), 3941 states have internal predecessors, (15569), 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:23:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 15569 transitions. [2020-11-11 23:23:17,013 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 15569 transitions. Word has length 12 [2020-11-11 23:23:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:17,015 INFO L481 AbstractCegarLoop]: Abstraction has 3942 states and 15569 transitions. [2020-11-11 23:23:17,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:23:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 15569 transitions. [2020-11-11 23:23:17,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-11 23:23:17,018 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:17,019 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:23:17,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-11 23:23:17,019 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:23:17,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:17,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2065679879, now seen corresponding path program 1 times [2020-11-11 23:23:17,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:17,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410147943] [2020-11-11 23:23:17,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:17,187 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:23:17,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410147943] [2020-11-11 23:23:17,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:17,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 23:23:17,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528743961] [2020-11-11 23:23:17,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:23:17,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:17,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:23:17,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:23:17,194 INFO L87 Difference]: Start difference. First operand 3942 states and 15569 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:23:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:17,296 INFO L93 Difference]: Finished difference Result 4536 states and 17384 transitions. [2020-11-11 23:23:17,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:23:17,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2020-11-11 23:23:17,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:17,338 INFO L225 Difference]: With dead ends: 4536 [2020-11-11 23:23:17,339 INFO L226 Difference]: Without dead ends: 3846 [2020-11-11 23:23:17,339 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:23:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2020-11-11 23:23:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 3846. [2020-11-11 23:23:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3846 states, 3845 states have (on average 3.9347204161248373) internal successors, (15129), 3845 states have internal predecessors, (15129), 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:23:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 15129 transitions. [2020-11-11 23:23:17,571 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 15129 transitions. Word has length 13 [2020-11-11 23:23:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:17,571 INFO L481 AbstractCegarLoop]: Abstraction has 3846 states and 15129 transitions. [2020-11-11 23:23:17,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:23:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 15129 transitions. [2020-11-11 23:23:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-11 23:23:17,575 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:17,575 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:23:17,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-11 23:23:17,575 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:23:17,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:17,576 INFO L82 PathProgramCache]: Analyzing trace with hash -388527281, now seen corresponding path program 1 times [2020-11-11 23:23:17,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:17,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589502482] [2020-11-11 23:23:17,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:17,702 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:23:17,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589502482] [2020-11-11 23:23:17,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:17,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 23:23:17,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539162029] [2020-11-11 23:23:17,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:23:17,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:17,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:23:17,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:23:17,706 INFO L87 Difference]: Start difference. First operand 3846 states and 15129 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:23:17,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:17,788 INFO L93 Difference]: Finished difference Result 4412 states and 16858 transitions. [2020-11-11 23:23:17,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:23:17,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2020-11-11 23:23:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:17,840 INFO L225 Difference]: With dead ends: 4412 [2020-11-11 23:23:17,841 INFO L226 Difference]: Without dead ends: 3770 [2020-11-11 23:23:17,841 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:23:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3770 states. [2020-11-11 23:23:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3770 to 3770. [2020-11-11 23:23:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3770 states, 3769 states have (on average 3.9227911912974265) internal successors, (14785), 3769 states have internal predecessors, (14785), 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:23:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 14785 transitions. [2020-11-11 23:23:18,086 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 14785 transitions. Word has length 14 [2020-11-11 23:23:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:18,087 INFO L481 AbstractCegarLoop]: Abstraction has 3770 states and 14785 transitions. [2020-11-11 23:23:18,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:23:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 14785 transitions. [2020-11-11 23:23:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-11 23:23:18,091 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:18,091 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:23:18,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-11 23:23:18,092 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:23:18,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:18,092 INFO L82 PathProgramCache]: Analyzing trace with hash 842279338, now seen corresponding path program 1 times [2020-11-11 23:23:18,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:18,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897154015] [2020-11-11 23:23:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:18,171 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:23:18,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897154015] [2020-11-11 23:23:18,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:18,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-11 23:23:18,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21805469] [2020-11-11 23:23:18,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:23:18,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:18,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:23:18,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:23:18,174 INFO L87 Difference]: Start difference. First operand 3770 states and 14785 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:23:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:18,285 INFO L93 Difference]: Finished difference Result 6230 states and 23598 transitions. [2020-11-11 23:23:18,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:23:18,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-11 23:23:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:18,309 INFO L225 Difference]: With dead ends: 6230 [2020-11-11 23:23:18,309 INFO L226 Difference]: Without dead ends: 4310 [2020-11-11 23:23:18,310 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:23:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4310 states. [2020-11-11 23:23:18,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4310 to 3620. [2020-11-11 23:23:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3620 states, 3619 states have (on average 3.79801050013816) internal successors, (13745), 3619 states have internal predecessors, (13745), 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:23:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 13745 transitions. [2020-11-11 23:23:18,542 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 13745 transitions. Word has length 15 [2020-11-11 23:23:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:18,542 INFO L481 AbstractCegarLoop]: Abstraction has 3620 states and 13745 transitions. [2020-11-11 23:23:18,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:23:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 13745 transitions. [2020-11-11 23:23:18,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-11 23:23:18,546 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:18,546 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:23:18,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-11 23:23:18,547 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:23:18,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:18,547 INFO L82 PathProgramCache]: Analyzing trace with hash 842341803, now seen corresponding path program 1 times [2020-11-11 23:23:18,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:18,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690178441] [2020-11-11 23:23:18,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:18,615 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:23:18,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690178441] [2020-11-11 23:23:18,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:18,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 23:23:18,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457240202] [2020-11-11 23:23:18,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:23:18,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:18,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:23:18,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:23:18,617 INFO L87 Difference]: Start difference. First operand 3620 states and 13745 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:23:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:18,670 INFO L93 Difference]: Finished difference Result 3827 states and 14184 transitions. [2020-11-11 23:23:18,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:23:18,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-11 23:23:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:18,687 INFO L225 Difference]: With dead ends: 3827 [2020-11-11 23:23:18,687 INFO L226 Difference]: Without dead ends: 3298 [2020-11-11 23:23:18,688 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:23:18,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2020-11-11 23:23:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3298. [2020-11-11 23:23:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3298 states, 3297 states have (on average 3.750985744616318) internal successors, (12367), 3297 states have internal predecessors, (12367), 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:23:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 12367 transitions. [2020-11-11 23:23:18,819 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 12367 transitions. Word has length 15 [2020-11-11 23:23:18,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:18,820 INFO L481 AbstractCegarLoop]: Abstraction has 3298 states and 12367 transitions. [2020-11-11 23:23:18,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:23:18,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 12367 transitions. [2020-11-11 23:23:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-11 23:23:18,828 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:18,828 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:23:18,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-11 23:23:18,828 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:23:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:18,829 INFO L82 PathProgramCache]: Analyzing trace with hash 341688016, now seen corresponding path program 1 times [2020-11-11 23:23:18,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:18,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201941025] [2020-11-11 23:23:18,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:18,942 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:23:18,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201941025] [2020-11-11 23:23:18,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:18,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-11 23:23:18,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706670058] [2020-11-11 23:23:18,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:23:18,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:18,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:23:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:23:18,945 INFO L87 Difference]: Start difference. First operand 3298 states and 12367 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:23:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:19,071 INFO L93 Difference]: Finished difference Result 3156 states and 10652 transitions. [2020-11-11 23:23:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-11 23:23:19,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:23:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:19,082 INFO L225 Difference]: With dead ends: 3156 [2020-11-11 23:23:19,082 INFO L226 Difference]: Without dead ends: 2406 [2020-11-11 23:23:19,083 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:23:19,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2020-11-11 23:23:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2406. [2020-11-11 23:23:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 2405 states have (on average 3.3376299376299374) internal successors, (8027), 2405 states have internal predecessors, (8027), 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:23:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 8027 transitions. [2020-11-11 23:23:19,178 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 8027 transitions. Word has length 16 [2020-11-11 23:23:19,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:19,179 INFO L481 AbstractCegarLoop]: Abstraction has 2406 states and 8027 transitions. [2020-11-11 23:23:19,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:23:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 8027 transitions. [2020-11-11 23:23:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-11 23:23:19,184 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:19,184 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:23:19,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-11 23:23:19,185 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:23:19,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:19,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1322866274, now seen corresponding path program 1 times [2020-11-11 23:23:19,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:19,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170040135] [2020-11-11 23:23:19,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:19,290 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:23:19,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170040135] [2020-11-11 23:23:19,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:19,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-11 23:23:19,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626269676] [2020-11-11 23:23:19,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:23:19,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:19,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:23:19,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:23:19,292 INFO L87 Difference]: Start difference. First operand 2406 states and 8027 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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:23:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:19,363 INFO L93 Difference]: Finished difference Result 3840 states and 12404 transitions. [2020-11-11 23:23:19,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:23:19,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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:23:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:19,375 INFO L225 Difference]: With dead ends: 3840 [2020-11-11 23:23:19,375 INFO L226 Difference]: Without dead ends: 2568 [2020-11-11 23:23:19,377 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:23:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2020-11-11 23:23:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2346. [2020-11-11 23:23:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 3.2063965884861405) internal successors, (7519), 2345 states have internal predecessors, (7519), 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:23:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 7519 transitions. [2020-11-11 23:23:19,470 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 7519 transitions. Word has length 19 [2020-11-11 23:23:19,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:19,470 INFO L481 AbstractCegarLoop]: Abstraction has 2346 states and 7519 transitions. [2020-11-11 23:23:19,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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:23:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 7519 transitions. [2020-11-11 23:23:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-11 23:23:19,476 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:19,476 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:23:19,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-11 23:23:19,476 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:23:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash -970398866, now seen corresponding path program 1 times [2020-11-11 23:23:19,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:19,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71106281] [2020-11-11 23:23:19,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:19,666 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:23:19,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71106281] [2020-11-11 23:23:19,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:19,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-11 23:23:19,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711652124] [2020-11-11 23:23:19,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-11 23:23:19,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:19,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-11 23:23:19,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:23:19,668 INFO L87 Difference]: Start difference. First operand 2346 states and 7519 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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:23:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:19,773 INFO L93 Difference]: Finished difference Result 1898 states and 5524 transitions. [2020-11-11 23:23:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:23:19,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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:23:19,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:19,780 INFO L225 Difference]: With dead ends: 1898 [2020-11-11 23:23:19,781 INFO L226 Difference]: Without dead ends: 1468 [2020-11-11 23:23:19,781 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:23:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-11-11 23:23:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1468. [2020-11-11 23:23:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1467 states have (on average 2.859577368779823) internal successors, (4195), 1467 states have internal predecessors, (4195), 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:23:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 4195 transitions. [2020-11-11 23:23:19,888 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 4195 transitions. Word has length 19 [2020-11-11 23:23:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:19,888 INFO L481 AbstractCegarLoop]: Abstraction has 1468 states and 4195 transitions. [2020-11-11 23:23:19,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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:23:19,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 4195 transitions. [2020-11-11 23:23:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-11 23:23:19,892 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:19,892 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] [2020-11-11 23:23:19,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-11 23:23:19,893 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:23:19,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:19,893 INFO L82 PathProgramCache]: Analyzing trace with hash 810617014, now seen corresponding path program 1 times [2020-11-11 23:23:19,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:19,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222669662] [2020-11-11 23:23:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:20,095 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:23:20,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222669662] [2020-11-11 23:23:20,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:20,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-11 23:23:20,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379664406] [2020-11-11 23:23:20,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 23:23:20,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:20,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 23:23:20,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-11 23:23:20,098 INFO L87 Difference]: Start difference. First operand 1468 states and 4195 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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:23:20,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:20,217 INFO L93 Difference]: Finished difference Result 1252 states and 3532 transitions. [2020-11-11 23:23:20,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 23:23:20,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2020-11-11 23:23:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:20,222 INFO L225 Difference]: With dead ends: 1252 [2020-11-11 23:23:20,222 INFO L226 Difference]: Without dead ends: 1062 [2020-11-11 23:23:20,222 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:23:20,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2020-11-11 23:23:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2020-11-11 23:23:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 2.828463713477851) internal successors, (3001), 1061 states have internal predecessors, (3001), 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:23:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 3001 transitions. [2020-11-11 23:23:20,261 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 3001 transitions. Word has length 22 [2020-11-11 23:23:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:20,263 INFO L481 AbstractCegarLoop]: Abstraction has 1062 states and 3001 transitions. [2020-11-11 23:23:20,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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:23:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 3001 transitions. [2020-11-11 23:23:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-11 23:23:20,267 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:20,267 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] [2020-11-11 23:23:20,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-11 23:23:20,267 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:23:20,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:20,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1678955678, now seen corresponding path program 1 times [2020-11-11 23:23:20,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:20,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404315581] [2020-11-11 23:23:20,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:20,375 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:23:20,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404315581] [2020-11-11 23:23:20,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:20,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-11 23:23:20,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474569898] [2020-11-11 23:23:20,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:23:20,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:20,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:23:20,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:23:20,378 INFO L87 Difference]: Start difference. First operand 1062 states and 3001 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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:23:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:20,416 INFO L93 Difference]: Finished difference Result 1456 states and 4013 transitions. [2020-11-11 23:23:20,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-11 23:23:20,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2020-11-11 23:23:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:20,421 INFO L225 Difference]: With dead ends: 1456 [2020-11-11 23:23:20,421 INFO L226 Difference]: Without dead ends: 958 [2020-11-11 23:23:20,422 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:23:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2020-11-11 23:23:20,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 952. [2020-11-11 23:23:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 951 states have (on average 2.6961093585699265) internal successors, (2564), 951 states have internal predecessors, (2564), 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:23:20,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2564 transitions. [2020-11-11 23:23:20,449 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2564 transitions. Word has length 25 [2020-11-11 23:23:20,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:20,450 INFO L481 AbstractCegarLoop]: Abstraction has 952 states and 2564 transitions. [2020-11-11 23:23:20,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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:23:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2564 transitions. [2020-11-11 23:23:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-11 23:23:20,453 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:20,453 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] [2020-11-11 23:23:20,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-11 23:23:20,453 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:23:20,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:20,454 INFO L82 PathProgramCache]: Analyzing trace with hash 637080688, now seen corresponding path program 2 times [2020-11-11 23:23:20,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:20,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666010204] [2020-11-11 23:23:20,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:20,659 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:23:20,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666010204] [2020-11-11 23:23:20,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:20,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 23:23:20,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639031679] [2020-11-11 23:23:20,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-11 23:23:20,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:20,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-11 23:23:20,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:23:20,661 INFO L87 Difference]: Start difference. First operand 952 states and 2564 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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:23:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:20,816 INFO L93 Difference]: Finished difference Result 910 states and 2481 transitions. [2020-11-11 23:23:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-11 23:23:20,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2020-11-11 23:23:20,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:20,818 INFO L225 Difference]: With dead ends: 910 [2020-11-11 23:23:20,818 INFO L226 Difference]: Without dead ends: 344 [2020-11-11 23:23:20,819 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-11-11 23:23:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-11-11 23:23:20,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2020-11-11 23:23:20,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 2.7434402332361514) internal successors, (941), 343 states have internal predecessors, (941), 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:23:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 941 transitions. [2020-11-11 23:23:20,827 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 941 transitions. Word has length 25 [2020-11-11 23:23:20,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:20,827 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 941 transitions. [2020-11-11 23:23:20,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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:23:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 941 transitions. [2020-11-11 23:23:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-11 23:23:20,829 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:20,829 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, 1, 1] [2020-11-11 23:23:20,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-11 23:23:20,829 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:23:20,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:20,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1162062930, now seen corresponding path program 1 times [2020-11-11 23:23:20,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:20,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492234891] [2020-11-11 23:23:20,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:21,480 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:23:21,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492234891] [2020-11-11 23:23:21,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:21,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-11 23:23:21,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978065224] [2020-11-11 23:23:21,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-11 23:23:21,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:21,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-11 23:23:21,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-11 23:23:21,483 INFO L87 Difference]: Start difference. First operand 344 states and 941 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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:23:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:23,152 INFO L93 Difference]: Finished difference Result 521 states and 1326 transitions. [2020-11-11 23:23:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-11 23:23:23,153 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 29 [2020-11-11 23:23:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:23,155 INFO L225 Difference]: With dead ends: 521 [2020-11-11 23:23:23,156 INFO L226 Difference]: Without dead ends: 355 [2020-11-11 23:23:23,156 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2020-11-11 23:23:23,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2020-11-11 23:23:23,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 318. [2020-11-11 23:23:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 2.470031545741325) internal successors, (783), 317 states have internal predecessors, (783), 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:23:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 783 transitions. [2020-11-11 23:23:23,165 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 783 transitions. Word has length 29 [2020-11-11 23:23:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:23,166 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 783 transitions. [2020-11-11 23:23:23,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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:23:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 783 transitions. [2020-11-11 23:23:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-11 23:23:23,167 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:23,167 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, 1, 1] [2020-11-11 23:23:23,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-11 23:23:23,168 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:23:23,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:23,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1788871534, now seen corresponding path program 2 times [2020-11-11 23:23:23,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:23,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234772188] [2020-11-11 23:23:23,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:23,523 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 28 [2020-11-11 23:23:23,683 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:23:23,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234772188] [2020-11-11 23:23:23,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:23,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-11 23:23:23,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103798638] [2020-11-11 23:23:23,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-11 23:23:23,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:23,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-11 23:23:23,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-11 23:23:23,685 INFO L87 Difference]: Start difference. First operand 318 states and 783 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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:23:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:24,243 INFO L93 Difference]: Finished difference Result 427 states and 1003 transitions. [2020-11-11 23:23:24,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-11 23:23:24,244 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2020-11-11 23:23:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:24,245 INFO L225 Difference]: With dead ends: 427 [2020-11-11 23:23:24,246 INFO L226 Difference]: Without dead ends: 282 [2020-11-11 23:23:24,246 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-11 23:23:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-11-11 23:23:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 242. [2020-11-11 23:23:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.4107883817427385) internal successors, (581), 241 states have internal predecessors, (581), 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:23:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 581 transitions. [2020-11-11 23:23:24,253 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 581 transitions. Word has length 29 [2020-11-11 23:23:24,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:24,253 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 581 transitions. [2020-11-11 23:23:24,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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:23:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 581 transitions. [2020-11-11 23:23:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-11 23:23:24,255 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:24,256 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, 1, 1] [2020-11-11 23:23:24,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-11 23:23:24,256 INFO L429 AbstractCegarLoop]: === Iteration 15 === [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:23:24,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:24,256 INFO L82 PathProgramCache]: Analyzing trace with hash 3475026, now seen corresponding path program 3 times [2020-11-11 23:23:24,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:24,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724936043] [2020-11-11 23:23:24,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:23:24,644 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:23:24,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724936043] [2020-11-11 23:23:24,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:23:24,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-11 23:23:24,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227323338] [2020-11-11 23:23:24,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-11 23:23:24,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:23:24,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-11 23:23:24,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-11 23:23:24,647 INFO L87 Difference]: Start difference. First operand 242 states and 581 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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:23:24,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:23:24,906 INFO L93 Difference]: Finished difference Result 293 states and 678 transitions. [2020-11-11 23:23:24,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-11 23:23:24,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2020-11-11 23:23:24,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:23:24,908 INFO L225 Difference]: With dead ends: 293 [2020-11-11 23:23:24,909 INFO L226 Difference]: Without dead ends: 232 [2020-11-11 23:23:24,909 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-11 23:23:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-11-11 23:23:24,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 227. [2020-11-11 23:23:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 2.3451327433628317) internal successors, (530), 226 states have internal predecessors, (530), 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:23:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 530 transitions. [2020-11-11 23:23:24,915 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 530 transitions. Word has length 29 [2020-11-11 23:23:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:23:24,915 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 530 transitions. [2020-11-11 23:23:24,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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:23:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 530 transitions. [2020-11-11 23:23:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-11 23:23:24,916 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:23:24,916 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, 1, 1] [2020-11-11 23:23:24,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-11 23:23:24,917 INFO L429 AbstractCegarLoop]: === Iteration 16 === [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:23:24,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:23:24,917 INFO L82 PathProgramCache]: Analyzing trace with hash 668110258, now seen corresponding path program 4 times [2020-11-11 23:23:24,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:23:24,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560069517] [2020-11-11 23:23:24,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:23:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 23:23:24,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 23:23:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 23:23:25,074 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 23:23:25,118 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-11 23:23:25,118 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-11 23:23:25,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-11 23:23:25,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 11:23:25 BasicIcfg [2020-11-11 23:23:25,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-11 23:23:25,278 INFO L168 Benchmark]: Toolchain (without parser) took 31140.19 ms. Allocated memory was 302.0 MB in the beginning and 742.4 MB in the end (delta: 440.4 MB). Free memory was 276.9 MB in the beginning and 419.9 MB in the end (delta: -143.0 MB). Peak memory consumption was 301.3 MB. Max. memory is 16.0 GB. [2020-11-11 23:23:25,278 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 302.0 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-11 23:23:25,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.53 ms. Allocated memory is still 302.0 MB. Free memory was 276.1 MB in the beginning and 241.0 MB in the end (delta: 35.1 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.0 GB. [2020-11-11 23:23:25,283 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.54 ms. Allocated memory is still 302.0 MB. Free memory was 241.0 MB in the beginning and 282.0 MB in the end (delta: -41.0 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2020-11-11 23:23:25,284 INFO L168 Benchmark]: Boogie Preprocessor took 89.40 ms. Allocated memory is still 302.0 MB. Free memory was 282.0 MB in the beginning and 279.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-11 23:23:25,285 INFO L168 Benchmark]: RCFGBuilder took 3585.44 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 279.9 MB in the beginning and 258.1 MB in the end (delta: 21.8 MB). Peak memory consumption was 178.3 MB. Max. memory is 16.0 GB. [2020-11-11 23:23:25,288 INFO L168 Benchmark]: TraceAbstraction took 26555.88 ms. Allocated memory was 362.8 MB in the beginning and 742.4 MB in the end (delta: 379.6 MB). Free memory was 258.1 MB in the beginning and 419.9 MB in the end (delta: -161.8 MB). Peak memory consumption was 219.9 MB. Max. memory is 16.0 GB. [2020-11-11 23:23:25,296 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 302.0 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 798.53 ms. Allocated memory is still 302.0 MB. Free memory was 276.1 MB in the beginning and 241.0 MB in the end (delta: 35.1 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 97.54 ms. Allocated memory is still 302.0 MB. Free memory was 241.0 MB in the beginning and 282.0 MB in the end (delta: -41.0 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 89.40 ms. Allocated memory is still 302.0 MB. Free memory was 282.0 MB in the beginning and 279.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 3585.44 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 279.9 MB in the beginning and 258.1 MB in the end (delta: 21.8 MB). Peak memory consumption was 178.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 26555.88 ms. Allocated memory was 362.8 MB in the beginning and 742.4 MB in the end (delta: 379.6 MB). Free memory was 258.1 MB in the beginning and 419.9 MB in the end (delta: -161.8 MB). Peak memory consumption was 219.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2046 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 53 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 225 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 15.7s, 132 PlacesBefore, 48 PlacesAfterwards, 122 TransitionsBefore, 36 TransitionsAfterwards, 3124 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 8870 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool b$flush_delayed; [L720] 0 int b$mem_tmp; [L721] 0 _Bool b$r_buff0_thd0; [L722] 0 _Bool b$r_buff0_thd1; [L723] 0 _Bool b$r_buff0_thd2; [L724] 0 _Bool b$r_buff0_thd3; [L725] 0 _Bool b$r_buff0_thd4; [L726] 0 _Bool b$r_buff1_thd0; [L727] 0 _Bool b$r_buff1_thd1; [L728] 0 _Bool b$r_buff1_thd2; [L729] 0 _Bool b$r_buff1_thd3; [L730] 0 _Bool b$r_buff1_thd4; [L731] 0 _Bool b$read_delayed; [L732] 0 int *b$read_delayed_var; [L733] 0 int b$w_buff0; [L734] 0 _Bool b$w_buff0_used; [L735] 0 int b$w_buff1; [L736] 0 _Bool b$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L867] 0 pthread_t t1265; [L868] FCALL, FORK 0 pthread_create(&t1265, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 b$w_buff1 = b$w_buff0 [L751] 1 b$w_buff0 = 1 [L752] 1 b$w_buff1_used = b$w_buff0_used [L753] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L755] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L756] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L757] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L758] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L759] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L869] 0 pthread_t t1266; [L870] FCALL, FORK 0 pthread_create(&t1266, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L871] 0 pthread_t t1267; [L872] FCALL, FORK 0 pthread_create(&t1267, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L873] 0 pthread_t t1268; [L874] FCALL, FORK 0 pthread_create(&t1268, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L786] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L786] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L786] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L787] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L787] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L788] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L788] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L789] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L789] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L790] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L800] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L806] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L806] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L806] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L806] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L807] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L807] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L808] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L808] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L809] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L809] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L810] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L820] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L823] 4 a = 1 [L826] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L829] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 4 b$flush_delayed = weak$$choice2 [L832] 4 b$mem_tmp = b [L833] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L833] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L834] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L834] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L834] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L834] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L835] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L835] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L835] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L835] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L836] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L836] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used) [L836] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L836] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L837] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L837] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L838] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4) [L838] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L838] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L839] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L839] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 __unbuffered_p3_EBX = b [L841] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L841] 4 b = b$flush_delayed ? b$mem_tmp : b [L842] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, z=2] [L766] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L845] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L845] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L845] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L845] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L846] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L846] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L847] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L847] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L848] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L848] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L849] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, z=2] [L3] COND FALSE 0 !(!cond) [L880] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L880] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L880] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L880] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L881] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L881] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L882] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L882] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L883] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L883] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L884] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix047_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 26.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.2s, HoareTripleCheckerStatistics: 626 SDtfs, 919 SDslu, 1685 SDs, 0 SdLazy, 970 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5774occurred 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: 1.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 1000 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 56618 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...