/usr/bin/java -Xmx8000000000 -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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 14:16:39,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 14:16:39,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 14:16:39,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 14:16:39,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 14:16:39,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 14:16:39,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 14:16:39,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 14:16:39,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 14:16:39,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 14:16:39,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 14:16:39,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 14:16:39,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 14:16:39,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 14:16:39,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 14:16:39,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 14:16:39,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 14:16:39,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 14:16:39,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 14:16:39,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 14:16:39,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 14:16:39,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 14:16:39,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 14:16:39,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 14:16:39,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 14:16:39,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 14:16:39,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 14:16:39,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 14:16:39,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 14:16:39,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 14:16:39,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 14:16:39,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 14:16:39,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 14:16:39,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 14:16:39,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 14:16:39,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 14:16:39,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 14:16:39,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 14:16:39,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 14:16:39,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 14:16:39,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 14:16:39,700 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-11-09 14:16:39,758 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 14:16:39,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 14:16:39,764 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 14:16:39,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 14:16:39,764 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 14:16:39,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 14:16:39,765 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 14:16:39,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 14:16:39,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 14:16:39,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 14:16:39,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 14:16:39,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 14:16:39,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 14:16:39,768 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 14:16:39,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 14:16:39,768 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 14:16:39,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 14:16:39,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 14:16:39,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 14:16:39,769 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 14:16:39,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 14:16:39,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 14:16:39,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 14:16:39,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 14:16:39,770 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 14:16:39,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 14:16:39,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 14:16:39,771 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 14:16:39,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-09 14:16:40,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 14:16:40,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 14:16:40,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 14:16:40,236 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 14:16:40,237 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 14:16:40,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i [2020-11-09 14:16:40,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c6d6e9f2/6e9dfcd48e96411e985333b8ce4380bd/FLAG8a1ba3174 [2020-11-09 14:16:41,117 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 14:16:41,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i [2020-11-09 14:16:41,155 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c6d6e9f2/6e9dfcd48e96411e985333b8ce4380bd/FLAG8a1ba3174 [2020-11-09 14:16:41,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c6d6e9f2/6e9dfcd48e96411e985333b8ce4380bd [2020-11-09 14:16:41,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 14:16:41,400 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 14:16:41,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 14:16:41,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 14:16:41,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 14:16:41,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:16:41" (1/1) ... [2020-11-09 14:16:41,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14efabab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:41, skipping insertion in model container [2020-11-09 14:16:41,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:16:41" (1/1) ... [2020-11-09 14:16:41,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 14:16:41,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 14:16:42,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 14:16:42,056 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 14:16:42,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 14:16:42,244 INFO L208 MainTranslator]: Completed translation [2020-11-09 14:16:42,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:42 WrapperNode [2020-11-09 14:16:42,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 14:16:42,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 14:16:42,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 14:16:42,247 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 14:16:42,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:42" (1/1) ... [2020-11-09 14:16:42,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:42" (1/1) ... [2020-11-09 14:16:42,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 14:16:42,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 14:16:42,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 14:16:42,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 14:16:42,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:42" (1/1) ... [2020-11-09 14:16:42,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:42" (1/1) ... [2020-11-09 14:16:42,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:42" (1/1) ... [2020-11-09 14:16:42,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:42" (1/1) ... [2020-11-09 14:16:42,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:42" (1/1) ... [2020-11-09 14:16:42,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:42" (1/1) ... [2020-11-09 14:16:42,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:42" (1/1) ... [2020-11-09 14:16:42,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 14:16:42,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 14:16:42,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 14:16:42,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 14:16:42,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:42" (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-09 14:16:42,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 14:16:42,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 14:16:42,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 14:16:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 14:16:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 14:16:42,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 14:16:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 14:16:42,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 14:16:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 14:16:42,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 14:16:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 14:16:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 14:16:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 14:16:42,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 14:16:42,533 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 14:16:46,376 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 14:16:46,377 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 14:16:46,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:16:46 BoogieIcfgContainer [2020-11-09 14:16:46,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 14:16:46,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 14:16:46,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 14:16:46,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 14:16:46,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:16:41" (1/3) ... [2020-11-09 14:16:46,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4961fe09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:16:46, skipping insertion in model container [2020-11-09 14:16:46,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:42" (2/3) ... [2020-11-09 14:16:46,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4961fe09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:16:46, skipping insertion in model container [2020-11-09 14:16:46,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:16:46" (3/3) ... [2020-11-09 14:16:46,388 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_rmo.opt.i [2020-11-09 14:16:46,405 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 14:16:46,405 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 14:16:46,410 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 14:16:46,411 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 14:16:46,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,464 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,464 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,465 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,465 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,483 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,483 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,483 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,506 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,506 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,507 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,507 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,571 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,572 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,573 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,574 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,584 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,592 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,593 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,593 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,598 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:16:46,603 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 14:16:46,616 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 14:16:46,640 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 14:16:46,640 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 14:16:46,640 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 14:16:46,640 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-09 14:16:46,641 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 14:16:46,641 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 14:16:46,641 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 14:16:46,641 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 14:16:46,654 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 14:16:46,655 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-11-09 14:16:46,658 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-11-09 14:16:46,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-11-09 14:16:46,713 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-11-09 14:16:46,713 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 14:16:46,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-11-09 14:16:46,721 INFO L116 LiptonReduction]: Number of co-enabled transitions 1844 [2020-11-09 14:16:48,535 WARN L194 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-11-09 14:16:48,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-11-09 14:16:48,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 14:16:48,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 14:16:48,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 14:16:49,572 WARN L194 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-11-09 14:16:52,006 WARN L194 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-11-09 14:16:52,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 14:16:52,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 14:16:52,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 14:16:52,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 14:16:52,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 14:16:52,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 14:16:52,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 14:16:52,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 14:16:52,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 14:16:52,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 14:16:52,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 14:16:52,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 14:16:52,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 14:16:52,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 14:16:52,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 14:16:52,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 14:16:52,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 14:16:52,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 14:16:52,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 14:16:52,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 14:16:52,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 14:16:52,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 14:16:52,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 14:16:52,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 14:16:52,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 14:16:52,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 14:16:52,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 14:16:52,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 14:16:52,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 14:16:52,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 14:16:52,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 14:16:52,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 14:16:52,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 14:16:52,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 14:16:52,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 14:16:52,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 14:16:52,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 14:16:55,984 WARN L194 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 358 DAG size of output: 257 [2020-11-09 14:16:56,840 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-09 14:16:56,967 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 14:16:57,149 WARN L194 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 14:16:58,570 WARN L194 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-11-09 14:16:59,023 WARN L194 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-11-09 14:17:00,137 WARN L194 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 244 [2020-11-09 14:17:01,228 WARN L194 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 244 [2020-11-09 14:17:01,572 WARN L194 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 14:17:01,693 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 14:17:02,308 WARN L194 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-11-09 14:17:02,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 14:17:02,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 14:17:02,813 WARN L194 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 14:17:03,631 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-09 14:17:03,797 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-09 14:17:05,487 WARN L194 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 137 DAG size of output: 128 [2020-11-09 14:17:05,943 WARN L194 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-11-09 14:17:09,392 WARN L194 SmtUtils]: Spent 3.45 s on a formula simplification. DAG size of input: 257 DAG size of output: 248 [2020-11-09 14:17:10,686 WARN L194 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 245 [2020-11-09 14:17:11,621 WARN L194 SmtUtils]: Spent 932.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-11-09 14:17:12,056 WARN L194 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-11-09 14:17:14,508 WARN L194 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 247 DAG size of output: 229 [2020-11-09 14:17:15,754 WARN L194 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 226 [2020-11-09 14:17:16,975 WARN L194 SmtUtils]: Spent 640.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-11-09 14:17:17,743 WARN L194 SmtUtils]: Spent 764.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-11-09 14:17:19,705 WARN L194 SmtUtils]: Spent 1.96 s on a formula simplification that was a NOOP. DAG size: 251 [2020-11-09 14:17:21,653 WARN L194 SmtUtils]: Spent 1.94 s on a formula simplification that was a NOOP. DAG size: 249 [2020-11-09 14:17:21,846 WARN L194 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 14:17:22,035 WARN L194 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 14:17:22,243 WARN L194 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 14:17:22,446 WARN L194 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 14:17:23,141 WARN L194 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2020-11-09 14:17:23,435 WARN L194 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-09 14:17:24,068 WARN L194 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2020-11-09 14:17:24,338 WARN L194 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-09 14:17:24,623 WARN L194 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 14:17:24,868 WARN L194 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 14:17:25,133 WARN L194 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 14:17:25,431 WARN L194 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 14:17:25,436 INFO L131 LiptonReduction]: Checked pairs total: 5104 [2020-11-09 14:17:25,436 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-11-09 14:17:25,443 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-11-09 14:17:25,507 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 778 states. [2020-11-09 14:17:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states. [2020-11-09 14:17:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 14:17:25,517 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:25,518 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:25,518 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:25,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2028141408, now seen corresponding path program 1 times [2020-11-09 14:17:25,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:25,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879855982] [2020-11-09 14:17:25,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:25,841 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-09 14:17:25,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879855982] [2020-11-09 14:17:25,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:25,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 14:17:25,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321962625] [2020-11-09 14:17:25,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 14:17:25,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 14:17:25,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:17:25,870 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 3 states. [2020-11-09 14:17:26,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:26,077 INFO L93 Difference]: Finished difference Result 658 states and 2050 transitions. [2020-11-09 14:17:26,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 14:17:26,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-09 14:17:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:26,120 INFO L225 Difference]: With dead ends: 658 [2020-11-09 14:17:26,121 INFO L226 Difference]: Without dead ends: 538 [2020-11-09 14:17:26,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:17:26,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-11-09 14:17:26,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2020-11-09 14:17:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-11-09 14:17:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1644 transitions. [2020-11-09 14:17:26,258 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1644 transitions. Word has length 7 [2020-11-09 14:17:26,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:26,259 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 1644 transitions. [2020-11-09 14:17:26,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 14:17:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1644 transitions. [2020-11-09 14:17:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 14:17:26,261 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:26,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:26,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 14:17:26,262 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:26,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:26,266 INFO L82 PathProgramCache]: Analyzing trace with hash -871165332, now seen corresponding path program 1 times [2020-11-09 14:17:26,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:26,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871067146] [2020-11-09 14:17:26,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:26,478 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-09 14:17:26,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871067146] [2020-11-09 14:17:26,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:26,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 14:17:26,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795142476] [2020-11-09 14:17:26,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 14:17:26,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:26,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 14:17:26,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 14:17:26,484 INFO L87 Difference]: Start difference. First operand 538 states and 1644 transitions. Second operand 4 states. [2020-11-09 14:17:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:26,664 INFO L93 Difference]: Finished difference Result 526 states and 1599 transitions. [2020-11-09 14:17:26,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 14:17:26,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-11-09 14:17:26,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:26,676 INFO L225 Difference]: With dead ends: 526 [2020-11-09 14:17:26,676 INFO L226 Difference]: Without dead ends: 526 [2020-11-09 14:17:26,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 14:17:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-11-09 14:17:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2020-11-09 14:17:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2020-11-09 14:17:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 1599 transitions. [2020-11-09 14:17:26,700 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 1599 transitions. Word has length 9 [2020-11-09 14:17:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:26,700 INFO L481 AbstractCegarLoop]: Abstraction has 526 states and 1599 transitions. [2020-11-09 14:17:26,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 14:17:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 1599 transitions. [2020-11-09 14:17:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 14:17:26,702 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:26,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:26,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 14:17:26,703 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:26,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:26,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1236321296, now seen corresponding path program 1 times [2020-11-09 14:17:26,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:26,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958118385] [2020-11-09 14:17:26,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:26,822 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-09 14:17:26,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958118385] [2020-11-09 14:17:26,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:26,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 14:17:26,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963476737] [2020-11-09 14:17:26,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 14:17:26,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:26,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 14:17:26,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:17:26,825 INFO L87 Difference]: Start difference. First operand 526 states and 1599 transitions. Second operand 3 states. [2020-11-09 14:17:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:26,853 INFO L93 Difference]: Finished difference Result 478 states and 1431 transitions. [2020-11-09 14:17:26,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 14:17:26,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 14:17:26,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:26,860 INFO L225 Difference]: With dead ends: 478 [2020-11-09 14:17:26,860 INFO L226 Difference]: Without dead ends: 478 [2020-11-09 14:17:26,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:17:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-11-09 14:17:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2020-11-09 14:17:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2020-11-09 14:17:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1431 transitions. [2020-11-09 14:17:26,881 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1431 transitions. Word has length 10 [2020-11-09 14:17:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:26,882 INFO L481 AbstractCegarLoop]: Abstraction has 478 states and 1431 transitions. [2020-11-09 14:17:26,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 14:17:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1431 transitions. [2020-11-09 14:17:26,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 14:17:26,885 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:26,885 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:26,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 14:17:26,885 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:26,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:26,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1139045776, now seen corresponding path program 1 times [2020-11-09 14:17:26,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:26,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675032902] [2020-11-09 14:17:26,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:27,067 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-09 14:17:27,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675032902] [2020-11-09 14:17:27,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:27,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 14:17:27,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731725162] [2020-11-09 14:17:27,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 14:17:27,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:27,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 14:17:27,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:17:27,072 INFO L87 Difference]: Start difference. First operand 478 states and 1431 transitions. Second operand 3 states. [2020-11-09 14:17:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:27,094 INFO L93 Difference]: Finished difference Result 472 states and 1409 transitions. [2020-11-09 14:17:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 14:17:27,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-09 14:17:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:27,100 INFO L225 Difference]: With dead ends: 472 [2020-11-09 14:17:27,101 INFO L226 Difference]: Without dead ends: 472 [2020-11-09 14:17:27,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:17:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-11-09 14:17:27,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2020-11-09 14:17:27,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2020-11-09 14:17:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1409 transitions. [2020-11-09 14:17:27,120 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1409 transitions. Word has length 12 [2020-11-09 14:17:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:27,120 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 1409 transitions. [2020-11-09 14:17:27,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 14:17:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1409 transitions. [2020-11-09 14:17:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 14:17:27,125 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:27,126 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:27,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 14:17:27,126 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:27,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:27,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2074178281, now seen corresponding path program 1 times [2020-11-09 14:17:27,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:27,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179449001] [2020-11-09 14:17:27,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:27,580 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-09 14:17:27,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179449001] [2020-11-09 14:17:27,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:27,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 14:17:27,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047889427] [2020-11-09 14:17:27,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 14:17:27,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:27,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 14:17:27,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 14:17:27,582 INFO L87 Difference]: Start difference. First operand 472 states and 1409 transitions. Second operand 6 states. [2020-11-09 14:17:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:27,885 INFO L93 Difference]: Finished difference Result 469 states and 1398 transitions. [2020-11-09 14:17:27,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 14:17:27,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-09 14:17:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:27,892 INFO L225 Difference]: With dead ends: 469 [2020-11-09 14:17:27,892 INFO L226 Difference]: Without dead ends: 469 [2020-11-09 14:17:27,893 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 14:17:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2020-11-09 14:17:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2020-11-09 14:17:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2020-11-09 14:17:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1398 transitions. [2020-11-09 14:17:27,910 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1398 transitions. Word has length 13 [2020-11-09 14:17:27,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:27,911 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 1398 transitions. [2020-11-09 14:17:27,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 14:17:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1398 transitions. [2020-11-09 14:17:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 14:17:27,913 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:27,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:27,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 14:17:27,913 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:27,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:27,914 INFO L82 PathProgramCache]: Analyzing trace with hash 124982949, now seen corresponding path program 1 times [2020-11-09 14:17:27,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:27,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475180783] [2020-11-09 14:17:27,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:28,340 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2020-11-09 14:17:28,515 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-09 14:17:28,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475180783] [2020-11-09 14:17:28,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:28,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 14:17:28,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228289001] [2020-11-09 14:17:28,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 14:17:28,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:28,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 14:17:28,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-09 14:17:28,518 INFO L87 Difference]: Start difference. First operand 469 states and 1398 transitions. Second operand 8 states. [2020-11-09 14:17:28,641 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2020-11-09 14:17:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:28,966 INFO L93 Difference]: Finished difference Result 583 states and 1759 transitions. [2020-11-09 14:17:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 14:17:28,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-11-09 14:17:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:28,977 INFO L225 Difference]: With dead ends: 583 [2020-11-09 14:17:28,977 INFO L226 Difference]: Without dead ends: 583 [2020-11-09 14:17:28,978 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-09 14:17:28,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-11-09 14:17:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 535. [2020-11-09 14:17:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2020-11-09 14:17:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1601 transitions. [2020-11-09 14:17:28,997 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1601 transitions. Word has length 14 [2020-11-09 14:17:28,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:28,998 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 1601 transitions. [2020-11-09 14:17:28,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 14:17:28,998 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1601 transitions. [2020-11-09 14:17:28,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 14:17:29,000 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:29,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:29,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 14:17:29,000 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:29,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:29,001 INFO L82 PathProgramCache]: Analyzing trace with hash 649647099, now seen corresponding path program 2 times [2020-11-09 14:17:29,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:29,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310129356] [2020-11-09 14:17:29,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:29,175 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-09 14:17:29,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310129356] [2020-11-09 14:17:29,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:29,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 14:17:29,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325792800] [2020-11-09 14:17:29,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 14:17:29,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:29,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 14:17:29,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 14:17:29,178 INFO L87 Difference]: Start difference. First operand 535 states and 1601 transitions. Second operand 5 states. [2020-11-09 14:17:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:29,464 INFO L93 Difference]: Finished difference Result 640 states and 1925 transitions. [2020-11-09 14:17:29,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 14:17:29,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 14:17:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:29,472 INFO L225 Difference]: With dead ends: 640 [2020-11-09 14:17:29,472 INFO L226 Difference]: Without dead ends: 640 [2020-11-09 14:17:29,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 14:17:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-11-09 14:17:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 544. [2020-11-09 14:17:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-11-09 14:17:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1615 transitions. [2020-11-09 14:17:29,494 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1615 transitions. Word has length 14 [2020-11-09 14:17:29,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:29,494 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 1615 transitions. [2020-11-09 14:17:29,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 14:17:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1615 transitions. [2020-11-09 14:17:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 14:17:29,496 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:29,496 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:29,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 14:17:29,497 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:29,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:29,497 INFO L82 PathProgramCache]: Analyzing trace with hash -420497362, now seen corresponding path program 1 times [2020-11-09 14:17:29,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:29,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795023211] [2020-11-09 14:17:29,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:29,651 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-09 14:17:29,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795023211] [2020-11-09 14:17:29,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:29,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 14:17:29,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251855174] [2020-11-09 14:17:29,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 14:17:29,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:29,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 14:17:29,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 14:17:29,653 INFO L87 Difference]: Start difference. First operand 544 states and 1615 transitions. Second operand 5 states. [2020-11-09 14:17:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:29,954 INFO L93 Difference]: Finished difference Result 704 states and 2033 transitions. [2020-11-09 14:17:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 14:17:29,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 14:17:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:29,962 INFO L225 Difference]: With dead ends: 704 [2020-11-09 14:17:29,962 INFO L226 Difference]: Without dead ends: 680 [2020-11-09 14:17:29,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 14:17:29,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-11-09 14:17:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 528. [2020-11-09 14:17:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2020-11-09 14:17:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1551 transitions. [2020-11-09 14:17:29,989 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1551 transitions. Word has length 15 [2020-11-09 14:17:29,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:29,989 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 1551 transitions. [2020-11-09 14:17:29,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 14:17:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1551 transitions. [2020-11-09 14:17:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 14:17:29,991 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:29,991 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:29,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 14:17:29,992 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:29,992 INFO L82 PathProgramCache]: Analyzing trace with hash -420497114, now seen corresponding path program 1 times [2020-11-09 14:17:29,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:29,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237250501] [2020-11-09 14:17:29,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:30,593 WARN L194 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 21 [2020-11-09 14:17:30,742 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 17 [2020-11-09 14:17:30,911 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 17 [2020-11-09 14:17:30,965 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-09 14:17:30,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237250501] [2020-11-09 14:17:30,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:30,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 14:17:30,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001538131] [2020-11-09 14:17:30,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 14:17:30,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:30,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 14:17:30,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-09 14:17:30,968 INFO L87 Difference]: Start difference. First operand 528 states and 1551 transitions. Second operand 9 states. [2020-11-09 14:17:31,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:31,357 INFO L93 Difference]: Finished difference Result 672 states and 2001 transitions. [2020-11-09 14:17:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 14:17:31,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-11-09 14:17:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:31,364 INFO L225 Difference]: With dead ends: 672 [2020-11-09 14:17:31,364 INFO L226 Difference]: Without dead ends: 672 [2020-11-09 14:17:31,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-09 14:17:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-11-09 14:17:31,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 600. [2020-11-09 14:17:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-11-09 14:17:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1797 transitions. [2020-11-09 14:17:31,391 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1797 transitions. Word has length 15 [2020-11-09 14:17:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:31,394 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 1797 transitions. [2020-11-09 14:17:31,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 14:17:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1797 transitions. [2020-11-09 14:17:31,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 14:17:31,396 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:31,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:31,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 14:17:31,396 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:31,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:31,397 INFO L82 PathProgramCache]: Analyzing trace with hash 112332092, now seen corresponding path program 2 times [2020-11-09 14:17:31,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:31,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372357806] [2020-11-09 14:17:31,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:31,865 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 19 [2020-11-09 14:17:32,013 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 26 [2020-11-09 14:17:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:17:32,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372357806] [2020-11-09 14:17:32,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:32,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 14:17:32,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273185243] [2020-11-09 14:17:32,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 14:17:32,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:32,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 14:17:32,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-09 14:17:32,074 INFO L87 Difference]: Start difference. First operand 600 states and 1797 transitions. Second operand 8 states. [2020-11-09 14:17:32,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:32,710 INFO L93 Difference]: Finished difference Result 954 states and 2766 transitions. [2020-11-09 14:17:32,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 14:17:32,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-11-09 14:17:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:32,720 INFO L225 Difference]: With dead ends: 954 [2020-11-09 14:17:32,720 INFO L226 Difference]: Without dead ends: 774 [2020-11-09 14:17:32,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-11-09 14:17:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2020-11-09 14:17:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 474. [2020-11-09 14:17:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2020-11-09 14:17:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1348 transitions. [2020-11-09 14:17:32,742 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1348 transitions. Word has length 15 [2020-11-09 14:17:32,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:32,742 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 1348 transitions. [2020-11-09 14:17:32,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 14:17:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1348 transitions. [2020-11-09 14:17:32,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 14:17:32,744 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:32,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:32,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 14:17:32,745 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:32,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:32,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1224071691, now seen corresponding path program 1 times [2020-11-09 14:17:32,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:32,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117306144] [2020-11-09 14:17:32,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:32,803 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-09 14:17:32,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117306144] [2020-11-09 14:17:32,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:32,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 14:17:32,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687877866] [2020-11-09 14:17:32,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 14:17:32,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:32,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 14:17:32,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:17:32,805 INFO L87 Difference]: Start difference. First operand 474 states and 1348 transitions. Second operand 3 states. [2020-11-09 14:17:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:32,830 INFO L93 Difference]: Finished difference Result 642 states and 1760 transitions. [2020-11-09 14:17:32,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 14:17:32,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-11-09 14:17:32,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:32,835 INFO L225 Difference]: With dead ends: 642 [2020-11-09 14:17:32,835 INFO L226 Difference]: Without dead ends: 364 [2020-11-09 14:17:32,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:17:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-11-09 14:17:32,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 352. [2020-11-09 14:17:32,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-11-09 14:17:32,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 918 transitions. [2020-11-09 14:17:32,848 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 918 transitions. Word has length 15 [2020-11-09 14:17:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:32,849 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 918 transitions. [2020-11-09 14:17:32,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 14:17:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 918 transitions. [2020-11-09 14:17:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:17:32,850 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:32,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:32,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 14:17:32,851 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:32,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:32,852 INFO L82 PathProgramCache]: Analyzing trace with hash -150517571, now seen corresponding path program 1 times [2020-11-09 14:17:32,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:32,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63462948] [2020-11-09 14:17:32,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:33,132 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-09 14:17:33,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63462948] [2020-11-09 14:17:33,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:33,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 14:17:33,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276744571] [2020-11-09 14:17:33,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 14:17:33,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:33,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 14:17:33,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-09 14:17:33,135 INFO L87 Difference]: Start difference. First operand 352 states and 918 transitions. Second operand 9 states. [2020-11-09 14:17:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:33,946 INFO L93 Difference]: Finished difference Result 592 states and 1540 transitions. [2020-11-09 14:17:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 14:17:33,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-11-09 14:17:33,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:33,952 INFO L225 Difference]: With dead ends: 592 [2020-11-09 14:17:33,952 INFO L226 Difference]: Without dead ends: 477 [2020-11-09 14:17:33,953 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-11-09 14:17:33,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2020-11-09 14:17:33,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 390. [2020-11-09 14:17:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-11-09 14:17:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1020 transitions. [2020-11-09 14:17:33,971 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1020 transitions. Word has length 16 [2020-11-09 14:17:33,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:33,971 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 1020 transitions. [2020-11-09 14:17:33,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 14:17:33,972 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1020 transitions. [2020-11-09 14:17:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:17:33,973 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:33,973 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:33,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 14:17:33,973 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:33,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:33,974 INFO L82 PathProgramCache]: Analyzing trace with hash 615881469, now seen corresponding path program 2 times [2020-11-09 14:17:33,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:33,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418408850] [2020-11-09 14:17:33,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:34,416 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2020-11-09 14:17:34,609 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 30 [2020-11-09 14:17:34,766 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2020-11-09 14:17:34,837 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-09 14:17:34,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418408850] [2020-11-09 14:17:34,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:34,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 14:17:34,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075792528] [2020-11-09 14:17:34,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 14:17:34,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:34,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 14:17:34,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 14:17:34,843 INFO L87 Difference]: Start difference. First operand 390 states and 1020 transitions. Second operand 7 states. [2020-11-09 14:17:35,083 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2020-11-09 14:17:35,228 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-11-09 14:17:35,396 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2020-11-09 14:17:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:35,627 INFO L93 Difference]: Finished difference Result 499 states and 1287 transitions. [2020-11-09 14:17:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 14:17:35,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-09 14:17:35,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:35,631 INFO L225 Difference]: With dead ends: 499 [2020-11-09 14:17:35,631 INFO L226 Difference]: Without dead ends: 349 [2020-11-09 14:17:35,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-11-09 14:17:35,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-11-09 14:17:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 274. [2020-11-09 14:17:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2020-11-09 14:17:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 701 transitions. [2020-11-09 14:17:35,643 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 701 transitions. Word has length 16 [2020-11-09 14:17:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:35,643 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 701 transitions. [2020-11-09 14:17:35,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 14:17:35,644 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 701 transitions. [2020-11-09 14:17:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:17:35,645 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:35,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:35,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 14:17:35,645 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:35,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:35,646 INFO L82 PathProgramCache]: Analyzing trace with hash -708483116, now seen corresponding path program 1 times [2020-11-09 14:17:35,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:35,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404298970] [2020-11-09 14:17:35,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:35,750 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-09 14:17:35,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404298970] [2020-11-09 14:17:35,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:35,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 14:17:35,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775871849] [2020-11-09 14:17:35,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 14:17:35,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:35,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 14:17:35,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 14:17:35,753 INFO L87 Difference]: Start difference. First operand 274 states and 701 transitions. Second operand 4 states. [2020-11-09 14:17:35,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:35,812 INFO L93 Difference]: Finished difference Result 264 states and 593 transitions. [2020-11-09 14:17:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 14:17:35,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-09 14:17:35,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:35,816 INFO L225 Difference]: With dead ends: 264 [2020-11-09 14:17:35,816 INFO L226 Difference]: Without dead ends: 184 [2020-11-09 14:17:35,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 14:17:35,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-11-09 14:17:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2020-11-09 14:17:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-11-09 14:17:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 396 transitions. [2020-11-09 14:17:35,827 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 396 transitions. Word has length 16 [2020-11-09 14:17:35,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:35,827 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 396 transitions. [2020-11-09 14:17:35,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 14:17:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 396 transitions. [2020-11-09 14:17:35,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 14:17:35,828 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:35,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:35,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 14:17:35,828 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:35,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:35,829 INFO L82 PathProgramCache]: Analyzing trace with hash -660816054, now seen corresponding path program 1 times [2020-11-09 14:17:35,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:35,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92295878] [2020-11-09 14:17:35,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:35,952 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-09 14:17:35,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92295878] [2020-11-09 14:17:35,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:35,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 14:17:35,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935316584] [2020-11-09 14:17:35,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 14:17:35,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:35,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 14:17:35,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 14:17:35,956 INFO L87 Difference]: Start difference. First operand 184 states and 396 transitions. Second operand 5 states. [2020-11-09 14:17:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:36,037 INFO L93 Difference]: Finished difference Result 157 states and 304 transitions. [2020-11-09 14:17:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 14:17:36,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-09 14:17:36,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:36,039 INFO L225 Difference]: With dead ends: 157 [2020-11-09 14:17:36,039 INFO L226 Difference]: Without dead ends: 120 [2020-11-09 14:17:36,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 14:17:36,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-11-09 14:17:36,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-11-09 14:17:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-11-09 14:17:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 223 transitions. [2020-11-09 14:17:36,044 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 223 transitions. Word has length 17 [2020-11-09 14:17:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:36,044 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 223 transitions. [2020-11-09 14:17:36,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 14:17:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 223 transitions. [2020-11-09 14:17:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 14:17:36,045 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:36,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:36,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 14:17:36,045 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:36,046 INFO L82 PathProgramCache]: Analyzing trace with hash -704085324, now seen corresponding path program 1 times [2020-11-09 14:17:36,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:36,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601499738] [2020-11-09 14:17:36,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:36,200 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-09 14:17:36,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601499738] [2020-11-09 14:17:36,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:36,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 14:17:36,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706239647] [2020-11-09 14:17:36,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 14:17:36,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:36,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 14:17:36,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 14:17:36,207 INFO L87 Difference]: Start difference. First operand 120 states and 223 transitions. Second operand 6 states. [2020-11-09 14:17:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:36,317 INFO L93 Difference]: Finished difference Result 108 states and 198 transitions. [2020-11-09 14:17:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 14:17:36,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-09 14:17:36,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:36,320 INFO L225 Difference]: With dead ends: 108 [2020-11-09 14:17:36,320 INFO L226 Difference]: Without dead ends: 69 [2020-11-09 14:17:36,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 14:17:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-09 14:17:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2020-11-09 14:17:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-09 14:17:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 108 transitions. [2020-11-09 14:17:36,323 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 108 transitions. Word has length 19 [2020-11-09 14:17:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:36,324 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 108 transitions. [2020-11-09 14:17:36,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 14:17:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 108 transitions. [2020-11-09 14:17:36,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 14:17:36,324 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:36,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:36,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 14:17:36,325 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:36,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:36,325 INFO L82 PathProgramCache]: Analyzing trace with hash 923951652, now seen corresponding path program 1 times [2020-11-09 14:17:36,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:36,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529448320] [2020-11-09 14:17:36,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:36,545 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-09 14:17:36,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529448320] [2020-11-09 14:17:36,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:36,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 14:17:36,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779938901] [2020-11-09 14:17:36,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 14:17:36,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:36,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 14:17:36,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 14:17:36,547 INFO L87 Difference]: Start difference. First operand 65 states and 108 transitions. Second operand 7 states. [2020-11-09 14:17:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:36,713 INFO L93 Difference]: Finished difference Result 94 states and 158 transitions. [2020-11-09 14:17:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 14:17:36,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-09 14:17:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:36,715 INFO L225 Difference]: With dead ends: 94 [2020-11-09 14:17:36,715 INFO L226 Difference]: Without dead ends: 64 [2020-11-09 14:17:36,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 14:17:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-09 14:17:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2020-11-09 14:17:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-09 14:17:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2020-11-09 14:17:36,719 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 21 [2020-11-09 14:17:36,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:36,719 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2020-11-09 14:17:36,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 14:17:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2020-11-09 14:17:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 14:17:36,720 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:36,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:36,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 14:17:36,721 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:36,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:36,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2122749894, now seen corresponding path program 2 times [2020-11-09 14:17:36,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:36,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099677840] [2020-11-09 14:17:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:36,970 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-09 14:17:36,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099677840] [2020-11-09 14:17:36,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:36,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 14:17:36,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611468524] [2020-11-09 14:17:36,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 14:17:36,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:36,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 14:17:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-09 14:17:36,973 INFO L87 Difference]: Start difference. First operand 62 states and 104 transitions. Second operand 7 states. [2020-11-09 14:17:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:37,171 INFO L93 Difference]: Finished difference Result 96 states and 165 transitions. [2020-11-09 14:17:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 14:17:37,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-09 14:17:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:37,173 INFO L225 Difference]: With dead ends: 96 [2020-11-09 14:17:37,174 INFO L226 Difference]: Without dead ends: 68 [2020-11-09 14:17:37,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-09 14:17:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-09 14:17:37,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-11-09 14:17:37,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-09 14:17:37,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 113 transitions. [2020-11-09 14:17:37,177 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 113 transitions. Word has length 21 [2020-11-09 14:17:37,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:37,177 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 113 transitions. [2020-11-09 14:17:37,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 14:17:37,177 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 113 transitions. [2020-11-09 14:17:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 14:17:37,178 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:37,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:37,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 14:17:37,178 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:37,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:37,179 INFO L82 PathProgramCache]: Analyzing trace with hash -405759700, now seen corresponding path program 3 times [2020-11-09 14:17:37,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:37,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117494620] [2020-11-09 14:17:37,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:37,673 WARN L194 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2020-11-09 14:17:38,092 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-09 14:17:38,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117494620] [2020-11-09 14:17:38,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:38,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-09 14:17:38,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690062169] [2020-11-09 14:17:38,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-09 14:17:38,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:38,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-09 14:17:38,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-09 14:17:38,094 INFO L87 Difference]: Start difference. First operand 68 states and 113 transitions. Second operand 13 states. [2020-11-09 14:17:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:38,701 INFO L93 Difference]: Finished difference Result 84 states and 139 transitions. [2020-11-09 14:17:38,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 14:17:38,703 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-11-09 14:17:38,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:38,704 INFO L225 Difference]: With dead ends: 84 [2020-11-09 14:17:38,704 INFO L226 Difference]: Without dead ends: 70 [2020-11-09 14:17:38,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:17:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-09 14:17:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-11-09 14:17:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-09 14:17:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 116 transitions. [2020-11-09 14:17:38,707 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 116 transitions. Word has length 21 [2020-11-09 14:17:38,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:38,707 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 116 transitions. [2020-11-09 14:17:38,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-09 14:17:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 116 transitions. [2020-11-09 14:17:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 14:17:38,708 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:38,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:38,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-09 14:17:38,708 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1865215846, now seen corresponding path program 4 times [2020-11-09 14:17:38,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:38,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983297940] [2020-11-09 14:17:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:39,128 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2020-11-09 14:17:39,364 WARN L194 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 31 [2020-11-09 14:17:39,619 WARN L194 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 25 [2020-11-09 14:17:39,813 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 21 [2020-11-09 14:17:40,077 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-09 14:17:40,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983297940] [2020-11-09 14:17:40,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:40,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 14:17:40,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902947549] [2020-11-09 14:17:40,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 14:17:40,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:40,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 14:17:40,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-09 14:17:40,079 INFO L87 Difference]: Start difference. First operand 70 states and 116 transitions. Second operand 10 states. [2020-11-09 14:17:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:40,507 INFO L93 Difference]: Finished difference Result 95 states and 153 transitions. [2020-11-09 14:17:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 14:17:40,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-11-09 14:17:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:40,510 INFO L225 Difference]: With dead ends: 95 [2020-11-09 14:17:40,510 INFO L226 Difference]: Without dead ends: 63 [2020-11-09 14:17:40,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:17:40,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-09 14:17:40,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2020-11-09 14:17:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-09 14:17:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 85 transitions. [2020-11-09 14:17:40,512 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 85 transitions. Word has length 21 [2020-11-09 14:17:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:40,512 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 85 transitions. [2020-11-09 14:17:40,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 14:17:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 85 transitions. [2020-11-09 14:17:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 14:17:40,513 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:40,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:40,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-09 14:17:40,514 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:40,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:40,514 INFO L82 PathProgramCache]: Analyzing trace with hash -38514942, now seen corresponding path program 5 times [2020-11-09 14:17:40,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:40,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658266330] [2020-11-09 14:17:40,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:40,865 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-09 14:17:40,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658266330] [2020-11-09 14:17:40,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:40,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 14:17:40,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276096731] [2020-11-09 14:17:40,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 14:17:40,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:40,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 14:17:40,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-09 14:17:40,867 INFO L87 Difference]: Start difference. First operand 52 states and 85 transitions. Second operand 10 states. [2020-11-09 14:17:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:41,316 INFO L93 Difference]: Finished difference Result 76 states and 126 transitions. [2020-11-09 14:17:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 14:17:41,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-11-09 14:17:41,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:41,320 INFO L225 Difference]: With dead ends: 76 [2020-11-09 14:17:41,321 INFO L226 Difference]: Without dead ends: 52 [2020-11-09 14:17:41,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-09 14:17:41,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-09 14:17:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-09 14:17:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-09 14:17:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 84 transitions. [2020-11-09 14:17:41,324 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 84 transitions. Word has length 21 [2020-11-09 14:17:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:41,324 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 84 transitions. [2020-11-09 14:17:41,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 14:17:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 84 transitions. [2020-11-09 14:17:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 14:17:41,325 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:41,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:41,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-09 14:17:41,325 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:41,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:41,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1051207474, now seen corresponding path program 6 times [2020-11-09 14:17:41,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:41,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406653936] [2020-11-09 14:17:41,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:41,692 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2020-11-09 14:17:42,100 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-09 14:17:42,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406653936] [2020-11-09 14:17:42,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:42,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 14:17:42,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288453912] [2020-11-09 14:17:42,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 14:17:42,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:42,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 14:17:42,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-09 14:17:42,102 INFO L87 Difference]: Start difference. First operand 52 states and 84 transitions. Second operand 11 states. [2020-11-09 14:17:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:42,980 INFO L93 Difference]: Finished difference Result 74 states and 122 transitions. [2020-11-09 14:17:42,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:17:42,981 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-11-09 14:17:42,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:42,982 INFO L225 Difference]: With dead ends: 74 [2020-11-09 14:17:42,982 INFO L226 Difference]: Without dead ends: 52 [2020-11-09 14:17:42,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2020-11-09 14:17:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-09 14:17:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-09 14:17:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-09 14:17:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 81 transitions. [2020-11-09 14:17:42,985 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 81 transitions. Word has length 21 [2020-11-09 14:17:42,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:42,985 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 81 transitions. [2020-11-09 14:17:42,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 14:17:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2020-11-09 14:17:42,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 14:17:42,986 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:42,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:42,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-09 14:17:42,987 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:42,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:42,988 INFO L82 PathProgramCache]: Analyzing trace with hash 425009248, now seen corresponding path program 7 times [2020-11-09 14:17:42,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:42,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861373133] [2020-11-09 14:17:42,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:17:43,377 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2020-11-09 14:17:43,535 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2020-11-09 14:17:43,723 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2020-11-09 14:17:43,968 WARN L194 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2020-11-09 14:17:44,236 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 32 [2020-11-09 14:17:44,308 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-09 14:17:44,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861373133] [2020-11-09 14:17:44,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:17:44,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 14:17:44,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522526531] [2020-11-09 14:17:44,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 14:17:44,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:17:44,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 14:17:44,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-09 14:17:44,311 INFO L87 Difference]: Start difference. First operand 52 states and 81 transitions. Second operand 9 states. [2020-11-09 14:17:44,602 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2020-11-09 14:17:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:17:45,021 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2020-11-09 14:17:45,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 14:17:45,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-11-09 14:17:45,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:17:45,023 INFO L225 Difference]: With dead ends: 71 [2020-11-09 14:17:45,023 INFO L226 Difference]: Without dead ends: 48 [2020-11-09 14:17:45,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-11-09 14:17:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-09 14:17:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2020-11-09 14:17:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-09 14:17:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2020-11-09 14:17:45,026 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 21 [2020-11-09 14:17:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:17:45,026 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-11-09 14:17:45,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 14:17:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2020-11-09 14:17:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 14:17:45,027 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:17:45,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:17:45,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-09 14:17:45,027 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:17:45,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:17:45,028 INFO L82 PathProgramCache]: Analyzing trace with hash -407008636, now seen corresponding path program 8 times [2020-11-09 14:17:45,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:17:45,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996827221] [2020-11-09 14:17:45,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:17:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 14:17:45,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 14:17:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 14:17:45,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 14:17:45,317 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 14:17:45,317 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 14:17:45,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-09 14:17:45,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:17:45 BasicIcfg [2020-11-09 14:17:45,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 14:17:45,479 INFO L168 Benchmark]: Toolchain (without parser) took 64084.74 ms. Allocated memory was 151.0 MB in the beginning and 380.6 MB in the end (delta: 229.6 MB). Free memory was 124.7 MB in the beginning and 298.5 MB in the end (delta: -173.8 MB). Peak memory consumption was 56.0 MB. Max. memory is 8.0 GB. [2020-11-09 14:17:45,480 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 151.0 MB. Free memory was 124.9 MB in the beginning and 124.8 MB in the end (delta: 84.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 14:17:45,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.74 ms. Allocated memory is still 151.0 MB. Free memory was 124.1 MB in the beginning and 118.0 MB in the end (delta: 6.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 8.0 GB. [2020-11-09 14:17:45,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.88 ms. Allocated memory is still 151.0 MB. Free memory was 118.0 MB in the beginning and 114.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 14:17:45,481 INFO L168 Benchmark]: Boogie Preprocessor took 67.16 ms. Allocated memory is still 151.0 MB. Free memory was 114.9 MB in the beginning and 111.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 14:17:45,482 INFO L168 Benchmark]: RCFGBuilder took 3975.44 ms. Allocated memory was 151.0 MB in the beginning and 185.6 MB in the end (delta: 34.6 MB). Free memory was 111.8 MB in the beginning and 76.2 MB in the end (delta: 35.6 MB). Peak memory consumption was 93.3 MB. Max. memory is 8.0 GB. [2020-11-09 14:17:45,486 INFO L168 Benchmark]: TraceAbstraction took 59096.27 ms. Allocated memory was 185.6 MB in the beginning and 380.6 MB in the end (delta: 195.0 MB). Free memory was 75.7 MB in the beginning and 298.5 MB in the end (delta: -222.8 MB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 14:17:45,489 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.28 ms. Allocated memory is still 151.0 MB. Free memory was 124.9 MB in the beginning and 124.8 MB in the end (delta: 84.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 843.74 ms. Allocated memory is still 151.0 MB. Free memory was 124.1 MB in the beginning and 118.0 MB in the end (delta: 6.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 88.88 ms. Allocated memory is still 151.0 MB. Free memory was 118.0 MB in the beginning and 114.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 67.16 ms. Allocated memory is still 151.0 MB. Free memory was 114.9 MB in the beginning and 111.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 3975.44 ms. Allocated memory was 151.0 MB in the beginning and 185.6 MB in the end (delta: 34.6 MB). Free memory was 111.8 MB in the beginning and 76.2 MB in the end (delta: 35.6 MB). Peak memory consumption was 93.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 59096.27 ms. Allocated memory was 185.6 MB in the beginning and 380.6 MB in the end (delta: 195.0 MB). Free memory was 75.7 MB in the beginning and 298.5 MB in the end (delta: -222.8 MB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 982 VarBasedMoverChecksPositive, 57 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 66 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 38.7s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 26 TransitionsAfterwards, 1844 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 5104 MoverChecksTotal - CounterExampleResult [Line: 18]: 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2552; [L850] FCALL, FORK 0 pthread_create(&t2552, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2553; [L852] FCALL, FORK 0 pthread_create(&t2553, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2554; [L854] FCALL, FORK 0 pthread_create(&t2554, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe032_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 58.6s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 38.8s, HoareTripleCheckerStatistics: 497 SDtfs, 552 SDslu, 1184 SDs, 0 SdLazy, 1459 SolverSat, 391 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 870 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 391 NumberOfCodeBlocks, 391 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 347 ConstructedInterpolants, 0 QuantifiedInterpolants, 77962 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...