/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:16:45,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:16:46,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:16:46,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:16:46,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:16:46,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:16:46,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:16:46,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:16:46,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:16:46,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:16:46,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:16:46,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:16:46,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:16:46,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:16:46,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:16:46,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:16:46,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:16:46,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:16:46,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:16:46,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:16:46,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:16:46,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:16:46,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:16:46,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:16:46,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:16:46,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:16:46,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:16:46,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:16:46,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:16:46,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:16:46,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:16:46,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:16:46,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:16:46,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:16:46,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:16:46,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:16:46,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:16:46,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:16:46,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:16:46,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:16:46,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:16:46,098 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-McrAutomaton-SP.epf [2020-10-22 02:16:46,123 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:16:46,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:16:46,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:16:46,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:16:46,125 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:16:46,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:16:46,126 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:16:46,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:16:46,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:16:46,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:16:46,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:16:46,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:16:46,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:16:46,127 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:16:46,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:16:46,127 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:16:46,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:16:46,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:16:46,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:16:46,128 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:16:46,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:16:46,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:16:46,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:16:46,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:16:46,129 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:16:46,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:16:46,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:16:46,130 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:16:46,130 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:16:46,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:16:46,130 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:16:46,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:16:46,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:16:46,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:16:46,452 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:16:46,455 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:16:46,456 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.oepc.i [2020-10-22 02:16:46,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df2a2f63/c021d8fb432d41dc90c2ecefaf0168e9/FLAGf9bdb6e5d [2020-10-22 02:16:47,067 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:16:47,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_rmo.oepc.i [2020-10-22 02:16:47,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df2a2f63/c021d8fb432d41dc90c2ecefaf0168e9/FLAGf9bdb6e5d [2020-10-22 02:16:47,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df2a2f63/c021d8fb432d41dc90c2ecefaf0168e9 [2020-10-22 02:16:47,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:16:47,365 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:16:47,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:16:47,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:16:47,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:16:47,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:16:47" (1/1) ... [2020-10-22 02:16:47,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cade521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:16:47, skipping insertion in model container [2020-10-22 02:16:47,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:16:47" (1/1) ... [2020-10-22 02:16:47,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:16:47,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:16:48,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:16:48,038 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:16:48,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:16:48,188 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:16:48,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:16:48 WrapperNode [2020-10-22 02:16:48,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:16:48,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:16:48,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:16:48,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:16:48,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:16:48" (1/1) ... [2020-10-22 02:16:48,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:16:48" (1/1) ... [2020-10-22 02:16:48,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:16:48,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:16:48,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:16:48,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:16:48,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:16:48" (1/1) ... [2020-10-22 02:16:48,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:16:48" (1/1) ... [2020-10-22 02:16:48,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:16:48" (1/1) ... [2020-10-22 02:16:48,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:16:48" (1/1) ... [2020-10-22 02:16:48,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:16:48" (1/1) ... [2020-10-22 02:16:48,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:16:48" (1/1) ... [2020-10-22 02:16:48,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:16:48" (1/1) ... [2020-10-22 02:16:48,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:16:48,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:16:48,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:16:48,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:16:48,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:16:48" (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-10-22 02:16:48,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-22 02:16:48,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:16:48,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:16:48,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:16:48,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:16:48,422 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:16:48,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:16:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:16:48,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:16:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:16:48,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:16:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:16:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:16:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:16:48,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:16:48,429 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 02:16:51,422 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:16:51,422 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-22 02:16:51,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:16:51 BoogieIcfgContainer [2020-10-22 02:16:51,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:16:51,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:16:51,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:16:51,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:16:51,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:16:47" (1/3) ... [2020-10-22 02:16:51,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0506a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:16:51, skipping insertion in model container [2020-10-22 02:16:51,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:16:48" (2/3) ... [2020-10-22 02:16:51,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0506a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:16:51, skipping insertion in model container [2020-10-22 02:16:51,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:16:51" (3/3) ... [2020-10-22 02:16:51,437 INFO L111 eAbstractionObserver]: Analyzing ICFG safe020_rmo.oepc.i [2020-10-22 02:16:51,455 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:16:51,455 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:16:51,465 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-22 02:16:51,466 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:16:51,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,517 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,529 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,530 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,533 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,534 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,552 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,552 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,564 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,566 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,576 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,577 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:16:51,585 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:16:51,603 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-22 02:16:51,634 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:16:51,635 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:16:51,635 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:16:51,635 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:16:51,635 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:16:51,636 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:16:51,636 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:16:51,636 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:16:51,652 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:16:51,653 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 116 transitions, 247 flow [2020-10-22 02:16:51,657 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 116 transitions, 247 flow [2020-10-22 02:16:51,660 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 116 transitions, 247 flow [2020-10-22 02:16:51,730 INFO L129 PetriNetUnfolder]: 3/113 cut-off events. [2020-10-22 02:16:51,731 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:16:51,738 INFO L80 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-22 02:16:51,742 INFO L116 LiptonReduction]: Number of co-enabled transitions 1562 [2020-10-22 02:16:54,087 WARN L193 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2020-10-22 02:16:54,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-22 02:16:54,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:16:54,876 WARN L193 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-22 02:16:55,319 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-10-22 02:16:55,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-22 02:16:55,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:16:55,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 02:16:55,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:16:55,452 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-22 02:16:55,972 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-22 02:16:56,790 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-10-22 02:16:57,192 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-22 02:16:57,642 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-22 02:16:57,830 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-22 02:16:58,529 WARN L193 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 157 [2020-10-22 02:16:58,886 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2020-10-22 02:16:58,894 INFO L131 LiptonReduction]: Checked pairs total: 4218 [2020-10-22 02:16:58,895 INFO L133 LiptonReduction]: Total number of compositions: 106 [2020-10-22 02:16:58,901 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 25 transitions, 65 flow [2020-10-22 02:16:58,941 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 522 states. [2020-10-22 02:16:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states. [2020-10-22 02:16:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 02:16:58,952 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:16:58,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:16:58,954 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:16:58,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:16:58,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1856140590, now seen corresponding path program 1 times [2020-10-22 02:16:58,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:16:58,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942971032] [2020-10-22 02:16:58,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:16:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:16:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:16:59,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942971032] [2020-10-22 02:16:59,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:16:59,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:16:59,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [953900532] [2020-10-22 02:16:59,186 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:16:59,189 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:16:59,205 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 02:16:59,205 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:16:59,210 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:16:59,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-22 02:16:59,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:16:59,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-22 02:16:59,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-22 02:16:59,228 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 2 states. [2020-10-22 02:16:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:16:59,252 INFO L93 Difference]: Finished difference Result 522 states and 1600 transitions. [2020-10-22 02:16:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-22 02:16:59,254 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-10-22 02:16:59,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:16:59,276 INFO L225 Difference]: With dead ends: 522 [2020-10-22 02:16:59,276 INFO L226 Difference]: Without dead ends: 442 [2020-10-22 02:16:59,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-22 02:16:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-22 02:16:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-10-22 02:16:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-10-22 02:16:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1336 transitions. [2020-10-22 02:16:59,412 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1336 transitions. Word has length 9 [2020-10-22 02:16:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:16:59,413 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1336 transitions. [2020-10-22 02:16:59,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-22 02:16:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1336 transitions. [2020-10-22 02:16:59,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:16:59,418 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:16:59,418 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:16:59,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:16:59,419 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:16:59,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:16:59,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1705201291, now seen corresponding path program 1 times [2020-10-22 02:16:59,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:16:59,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958483961] [2020-10-22 02:16:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:16:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:16:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:16:59,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958483961] [2020-10-22 02:16:59,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:16:59,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:16:59,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [978072147] [2020-10-22 02:16:59,609 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:16:59,611 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:16:59,613 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-22 02:16:59,613 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:16:59,613 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:16:59,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:16:59,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:16:59,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:16:59,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:16:59,616 INFO L87 Difference]: Start difference. First operand 442 states and 1336 transitions. Second operand 5 states. [2020-10-22 02:16:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:16:59,673 INFO L93 Difference]: Finished difference Result 490 states and 1424 transitions. [2020-10-22 02:16:59,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:16:59,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-22 02:16:59,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:16:59,678 INFO L225 Difference]: With dead ends: 490 [2020-10-22 02:16:59,679 INFO L226 Difference]: Without dead ends: 410 [2020-10-22 02:16:59,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:16:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-10-22 02:16:59,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2020-10-22 02:16:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-10-22 02:16:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1224 transitions. [2020-10-22 02:16:59,698 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1224 transitions. Word has length 10 [2020-10-22 02:16:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:16:59,699 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 1224 transitions. [2020-10-22 02:16:59,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:16:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1224 transitions. [2020-10-22 02:16:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:16:59,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:16:59,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:16:59,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:16:59,702 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:16:59,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:16:59,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1321648060, now seen corresponding path program 1 times [2020-10-22 02:16:59,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:16:59,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383328345] [2020-10-22 02:16:59,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:16:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:16:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:16:59,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383328345] [2020-10-22 02:16:59,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:16:59,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:16:59,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [205055910] [2020-10-22 02:16:59,816 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:16:59,818 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:16:59,820 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 02:16:59,820 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:16:59,821 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:16:59,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:16:59,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:16:59,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:16:59,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:16:59,822 INFO L87 Difference]: Start difference. First operand 410 states and 1224 transitions. Second operand 4 states. [2020-10-22 02:16:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:16:59,864 INFO L93 Difference]: Finished difference Result 466 states and 1342 transitions. [2020-10-22 02:16:59,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:16:59,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-22 02:16:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:16:59,868 INFO L225 Difference]: With dead ends: 466 [2020-10-22 02:16:59,869 INFO L226 Difference]: Without dead ends: 402 [2020-10-22 02:16:59,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:16:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-10-22 02:16:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2020-10-22 02:16:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-10-22 02:16:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1194 transitions. [2020-10-22 02:16:59,884 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1194 transitions. Word has length 11 [2020-10-22 02:16:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:16:59,884 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 1194 transitions. [2020-10-22 02:16:59,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:16:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1194 transitions. [2020-10-22 02:16:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:16:59,886 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:16:59,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:16:59,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:16:59,887 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:16:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:16:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1199301264, now seen corresponding path program 1 times [2020-10-22 02:16:59,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:16:59,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913586035] [2020-10-22 02:16:59,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:16:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:17:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:17:00,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913586035] [2020-10-22 02:17:00,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:17:00,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:17:00,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1539964426] [2020-10-22 02:17:00,178 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:17:00,180 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:17:00,183 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 26 transitions. [2020-10-22 02:17:00,184 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:17:00,486 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:17:00,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:17:00,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:17:00,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:17:00,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:17:00,488 INFO L87 Difference]: Start difference. First operand 402 states and 1194 transitions. Second operand 7 states. [2020-10-22 02:17:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:17:00,886 INFO L93 Difference]: Finished difference Result 448 states and 1282 transitions. [2020-10-22 02:17:00,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:17:00,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-10-22 02:17:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:17:00,892 INFO L225 Difference]: With dead ends: 448 [2020-10-22 02:17:00,892 INFO L226 Difference]: Without dead ends: 388 [2020-10-22 02:17:00,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:17:00,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-10-22 02:17:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2020-10-22 02:17:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-10-22 02:17:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1142 transitions. [2020-10-22 02:17:00,909 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1142 transitions. Word has length 12 [2020-10-22 02:17:00,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:17:00,910 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 1142 transitions. [2020-10-22 02:17:00,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:17:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1142 transitions. [2020-10-22 02:17:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:17:00,916 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:17:00,916 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:17:00,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:17:00,917 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:17:00,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:17:00,917 INFO L82 PathProgramCache]: Analyzing trace with hash -410551312, now seen corresponding path program 1 times [2020-10-22 02:17:00,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:17:00,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576640167] [2020-10-22 02:17:00,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:17:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:17:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:17:01,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576640167] [2020-10-22 02:17:01,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:17:01,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 02:17:01,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1125055304] [2020-10-22 02:17:01,294 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:17:01,297 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:17:01,301 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-22 02:17:01,301 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:17:01,302 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:17:01,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 02:17:01,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:17:01,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 02:17:01,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:17:01,303 INFO L87 Difference]: Start difference. First operand 388 states and 1142 transitions. Second operand 9 states. [2020-10-22 02:17:01,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:17:01,549 INFO L93 Difference]: Finished difference Result 404 states and 1162 transitions. [2020-10-22 02:17:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:17:01,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-10-22 02:17:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:17:01,553 INFO L225 Difference]: With dead ends: 404 [2020-10-22 02:17:01,553 INFO L226 Difference]: Without dead ends: 372 [2020-10-22 02:17:01,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-10-22 02:17:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2020-10-22 02:17:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2020-10-22 02:17:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-10-22 02:17:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1090 transitions. [2020-10-22 02:17:01,566 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1090 transitions. Word has length 13 [2020-10-22 02:17:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:17:01,567 INFO L481 AbstractCegarLoop]: Abstraction has 372 states and 1090 transitions. [2020-10-22 02:17:01,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 02:17:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1090 transitions. [2020-10-22 02:17:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:17:01,568 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:17:01,568 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:17:01,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:17:01,569 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:17:01,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:17:01,569 INFO L82 PathProgramCache]: Analyzing trace with hash -932428959, now seen corresponding path program 1 times [2020-10-22 02:17:01,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:17:01,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028785489] [2020-10-22 02:17:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:17:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:17:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:17:01,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028785489] [2020-10-22 02:17:01,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:17:01,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:17:01,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1990430702] [2020-10-22 02:17:01,657 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:17:01,659 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:17:01,664 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 29 transitions. [2020-10-22 02:17:01,664 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:17:01,799 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:17:01,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:17:01,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:17:01,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:17:01,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:17:01,801 INFO L87 Difference]: Start difference. First operand 372 states and 1090 transitions. Second operand 4 states. [2020-10-22 02:17:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:17:01,841 INFO L93 Difference]: Finished difference Result 348 states and 894 transitions. [2020-10-22 02:17:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:17:01,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-22 02:17:01,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:17:01,844 INFO L225 Difference]: With dead ends: 348 [2020-10-22 02:17:01,845 INFO L226 Difference]: Without dead ends: 268 [2020-10-22 02:17:01,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:17:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-10-22 02:17:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2020-10-22 02:17:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-10-22 02:17:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 674 transitions. [2020-10-22 02:17:01,856 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 674 transitions. Word has length 13 [2020-10-22 02:17:01,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:17:01,857 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 674 transitions. [2020-10-22 02:17:01,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:17:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 674 transitions. [2020-10-22 02:17:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:17:01,858 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:17:01,858 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:17:01,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:17:01,859 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:17:01,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:17:01,859 INFO L82 PathProgramCache]: Analyzing trace with hash -401761040, now seen corresponding path program 1 times [2020-10-22 02:17:01,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:17:01,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414877081] [2020-10-22 02:17:01,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:17:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:17:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:17:02,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414877081] [2020-10-22 02:17:02,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:17:02,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:17:02,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1744673147] [2020-10-22 02:17:02,073 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:17:02,076 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:17:02,082 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 25 transitions. [2020-10-22 02:17:02,082 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:17:02,160 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8462#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:17:02,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:17:02,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:17:02,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:17:02,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:17:02,161 INFO L87 Difference]: Start difference. First operand 268 states and 674 transitions. Second operand 6 states. [2020-10-22 02:17:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:17:02,210 INFO L93 Difference]: Finished difference Result 206 states and 465 transitions. [2020-10-22 02:17:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:17:02,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-22 02:17:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:17:02,212 INFO L225 Difference]: With dead ends: 206 [2020-10-22 02:17:02,212 INFO L226 Difference]: Without dead ends: 162 [2020-10-22 02:17:02,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:17:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-22 02:17:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-22 02:17:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-22 02:17:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 356 transitions. [2020-10-22 02:17:02,217 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 356 transitions. Word has length 15 [2020-10-22 02:17:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:17:02,218 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 356 transitions. [2020-10-22 02:17:02,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:17:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 356 transitions. [2020-10-22 02:17:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 02:17:02,219 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:17:02,219 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:17:02,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:17:02,219 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:17:02,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:17:02,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1254100355, now seen corresponding path program 1 times [2020-10-22 02:17:02,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:17:02,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653175624] [2020-10-22 02:17:02,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:17:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:17:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:17:02,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653175624] [2020-10-22 02:17:02,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:17:02,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:17:02,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [86750434] [2020-10-22 02:17:02,394 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:17:02,398 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:17:02,410 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 33 transitions. [2020-10-22 02:17:02,410 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:17:02,532 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9001#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:17:02,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:17:02,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:17:02,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:17:02,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:17:02,534 INFO L87 Difference]: Start difference. First operand 162 states and 356 transitions. Second operand 7 states. [2020-10-22 02:17:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:17:02,598 INFO L93 Difference]: Finished difference Result 137 states and 304 transitions. [2020-10-22 02:17:02,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:17:02,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-22 02:17:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:17:02,600 INFO L225 Difference]: With dead ends: 137 [2020-10-22 02:17:02,600 INFO L226 Difference]: Without dead ends: 126 [2020-10-22 02:17:02,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:17:02,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-10-22 02:17:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2020-10-22 02:17:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-10-22 02:17:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 284 transitions. [2020-10-22 02:17:02,605 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 284 transitions. Word has length 17 [2020-10-22 02:17:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:17:02,605 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 284 transitions. [2020-10-22 02:17:02,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:17:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 284 transitions. [2020-10-22 02:17:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 02:17:02,606 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:17:02,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:17:02,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:17:02,607 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:17:02,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:17:02,607 INFO L82 PathProgramCache]: Analyzing trace with hash -55948414, now seen corresponding path program 1 times [2020-10-22 02:17:02,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:17:02,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746095982] [2020-10-22 02:17:02,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:17:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:17:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:17:02,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746095982] [2020-10-22 02:17:02,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:17:02,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:17:02,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [852530540] [2020-10-22 02:17:02,710 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:17:02,717 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:17:02,742 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2020-10-22 02:17:02,742 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:17:02,813 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:17:02,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:17:02,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:17:02,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:17:02,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:17:02,814 INFO L87 Difference]: Start difference. First operand 126 states and 284 transitions. Second operand 4 states. [2020-10-22 02:17:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:17:02,837 INFO L93 Difference]: Finished difference Result 165 states and 362 transitions. [2020-10-22 02:17:02,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:17:02,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-22 02:17:02,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:17:02,839 INFO L225 Difference]: With dead ends: 165 [2020-10-22 02:17:02,839 INFO L226 Difference]: Without dead ends: 72 [2020-10-22 02:17:02,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:17:02,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-22 02:17:02,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-10-22 02:17:02,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-22 02:17:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 140 transitions. [2020-10-22 02:17:02,843 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 140 transitions. Word has length 20 [2020-10-22 02:17:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:17:02,843 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 140 transitions. [2020-10-22 02:17:02,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:17:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 140 transitions. [2020-10-22 02:17:02,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 02:17:02,846 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:17:02,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:17:02,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:17:02,846 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:17:02,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:17:02,847 INFO L82 PathProgramCache]: Analyzing trace with hash 229615954, now seen corresponding path program 2 times [2020-10-22 02:17:02,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:17:02,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410517781] [2020-10-22 02:17:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:17:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:17:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:17:03,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410517781] [2020-10-22 02:17:03,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:17:03,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:17:03,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [324249360] [2020-10-22 02:17:03,207 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:17:03,213 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:17:03,231 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 65 transitions. [2020-10-22 02:17:03,231 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:17:03,369 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 02:17:03,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:03,378 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 02:17:03,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:03,385 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:17:03,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:03,389 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:17:03,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:03,391 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 02:17:03,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:03,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:03,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:03,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:03,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:03,439 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 02:17:03,441 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,445 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,454 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,461 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:03,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:03,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:03,487 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 5 conjuncts [2020-10-22 02:17:03,488 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:03,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:03,491 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:03,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:03,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:03,651 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,692 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:03,695 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,698 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,708 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,714 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,721 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,728 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,733 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:03,742 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 02:17:03,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:03,745 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,811 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,812 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:03,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,867 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,873 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,882 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 02:17:03,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:03,884 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,944 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,953 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 02:17:03,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,969 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:03,981 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 02:17:03,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:03,996 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:04,007 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 02:17:04,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,011 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,012 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,021 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:04,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,031 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:04,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:04,036 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 3 conjuncts [2020-10-22 02:17:04,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:04,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:04,038 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:04,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,045 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:17:04,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:04,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,051 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:04,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:04,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:04,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:04,072 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:04,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:04,081 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:04,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,089 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:04,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:04,107 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 3 conjuncts [2020-10-22 02:17:04,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:04,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:04,109 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:04,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,120 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:04,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:04,141 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:04,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:04,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:04,152 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:04,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,161 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:17:04,163 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:04,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:04,183 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:04,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,192 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:17:04,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:04,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,200 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:04,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:04,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:04,219 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:04,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:04,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:04,243 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 5 conjuncts [2020-10-22 02:17:04,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:04,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:04,247 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:04,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:04,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,271 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,274 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:04,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:04,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:04,452 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:04,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:04,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:04,500 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:04,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:04,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:04,629 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:04,637 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 02:17:04,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,657 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:04,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:04,671 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:04,950 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-10-22 02:17:05,145 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 34 [2020-10-22 02:17:05,312 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 29 [2020-10-22 02:17:05,458 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9716#(and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd0~0) (or (= ~__unbuffered_p2_EAX~0 0) (= (mod ~x$r_buff0_thd3~0 256) 0)) (or (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p2_EAX~0 ~x$w_buff1~0) (= (mod ~x$r_buff1_thd3~0 256) 0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (or (= ~__unbuffered_p2_EAX~0 0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0)) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0))] [2020-10-22 02:17:05,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 02:17:05,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:17:05,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 02:17:05,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:17:05,459 INFO L87 Difference]: Start difference. First operand 72 states and 140 transitions. Second operand 9 states. [2020-10-22 02:17:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:17:05,754 INFO L93 Difference]: Finished difference Result 114 states and 223 transitions. [2020-10-22 02:17:05,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:17:05,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-22 02:17:05,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:17:05,755 INFO L225 Difference]: With dead ends: 114 [2020-10-22 02:17:05,755 INFO L226 Difference]: Without dead ends: 79 [2020-10-22 02:17:05,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-10-22 02:17:05,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-22 02:17:05,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2020-10-22 02:17:05,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-22 02:17:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 128 transitions. [2020-10-22 02:17:05,758 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 128 transitions. Word has length 20 [2020-10-22 02:17:05,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:17:05,758 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 128 transitions. [2020-10-22 02:17:05,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 02:17:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 128 transitions. [2020-10-22 02:17:05,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 02:17:05,759 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:17:05,759 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:17:05,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 02:17:05,760 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:17:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:17:05,760 INFO L82 PathProgramCache]: Analyzing trace with hash -79065646, now seen corresponding path program 3 times [2020-10-22 02:17:05,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:17:05,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978388120] [2020-10-22 02:17:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:17:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:17:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:17:06,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978388120] [2020-10-22 02:17:06,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:17:06,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 02:17:06,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [970227595] [2020-10-22 02:17:06,105 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:17:06,110 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:17:06,125 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 37 transitions. [2020-10-22 02:17:06,125 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:17:06,146 INFO L603 QuantifierPusher]: Distributing 9 disjuncts over 2 conjuncts [2020-10-22 02:17:06,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,149 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 02:17:06,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,151 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:17:06,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,153 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:17:06,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,155 INFO L603 QuantifierPusher]: Distributing 10 disjuncts over 2 conjuncts [2020-10-22 02:17:06,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,156 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:06,156 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:17:06,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,160 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:06,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,177 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:06,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,192 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:06,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,198 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:17:06,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,199 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:06,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,209 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:06,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,231 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:06,238 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:06,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,245 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:06,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,253 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:06,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,257 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:06,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,265 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,266 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,271 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:06,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,279 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:06,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,361 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:06,361 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:06,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,369 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,375 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 5, 2, 4, 2, 1] term [2020-10-22 02:17:06,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,377 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 4 conjuncts [2020-10-22 02:17:06,378 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:17:06,379 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:06,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,397 INFO L603 QuantifierPusher]: Distributing 10 disjuncts over 2 conjuncts [2020-10-22 02:17:06,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,399 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:06,400 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:06,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,411 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:06,418 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:06,423 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:06,424 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:06,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,438 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,441 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:06,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,448 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:06,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:17:06,456 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:06,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,464 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:17:06,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,473 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:06,480 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:06,483 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:06,502 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:06,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,515 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:06,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,523 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,526 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:06,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:06,535 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:06,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,548 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:06,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,556 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:06,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:17:06,575 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-22 02:17:06,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,583 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 02:17:06,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:17:06,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,600 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:06,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:06,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:06,745 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9978#(and (= (mod ~x$w_buff0_used~0 256) 0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (or (= ~__unbuffered_p2_EAX~0 ~x$w_buff1~0) (= (mod ~x$r_buff1_thd3~0 256) 0)) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)))] [2020-10-22 02:17:06,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-22 02:17:06,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:17:06,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-22 02:17:06,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-22 02:17:06,746 INFO L87 Difference]: Start difference. First operand 66 states and 128 transitions. Second operand 10 states. [2020-10-22 02:17:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:17:07,022 INFO L93 Difference]: Finished difference Result 94 states and 182 transitions. [2020-10-22 02:17:07,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:17:07,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-22 02:17:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:17:07,024 INFO L225 Difference]: With dead ends: 94 [2020-10-22 02:17:07,024 INFO L226 Difference]: Without dead ends: 73 [2020-10-22 02:17:07,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-10-22 02:17:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-22 02:17:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-10-22 02:17:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-22 02:17:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 143 transitions. [2020-10-22 02:17:07,028 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 143 transitions. Word has length 20 [2020-10-22 02:17:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:17:07,028 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 143 transitions. [2020-10-22 02:17:07,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-22 02:17:07,029 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 143 transitions. [2020-10-22 02:17:07,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 02:17:07,029 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:17:07,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:17:07,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 02:17:07,030 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:17:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:17:07,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2081305744, now seen corresponding path program 4 times [2020-10-22 02:17:07,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:17:07,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252048567] [2020-10-22 02:17:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:17:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:17:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:17:07,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252048567] [2020-10-22 02:17:07,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:17:07,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-22 02:17:07,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1808031571] [2020-10-22 02:17:07,350 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:17:07,355 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:17:07,371 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 37 transitions. [2020-10-22 02:17:07,371 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:17:07,390 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:17:07,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:07,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:07,395 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:17:07,395 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:07,397 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:17:07,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:07,398 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 02:17:07,400 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:07,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,407 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:07,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:07,413 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:07,417 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:17:07,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:07,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:07,429 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:07,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:07,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:07,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:07,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:07,456 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:07,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,463 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:07,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:07,469 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:07,473 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:17:07,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:07,475 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:07,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:07,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:07,490 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:07,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,500 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:07,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:07,506 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:17:07,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:07,507 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:07,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:07,517 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:07,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:07,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:07,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:07,538 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:07,544 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 5, 2, 4, 2, 1] term [2020-10-22 02:17:07,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:07,749 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 23 [2020-10-22 02:17:07,773 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10238#(and (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 0) (or (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) 1) (= 2 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|))) (= (mod ~x$r_buff1_thd3~0 256) 0) (= ~__unbuffered_cnt~0 0))] [2020-10-22 02:17:07,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-22 02:17:07,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:17:07,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-22 02:17:07,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-10-22 02:17:07,775 INFO L87 Difference]: Start difference. First operand 73 states and 143 transitions. Second operand 14 states. [2020-10-22 02:17:08,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:17:08,261 INFO L93 Difference]: Finished difference Result 108 states and 213 transitions. [2020-10-22 02:17:08,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-22 02:17:08,261 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2020-10-22 02:17:08,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:17:08,262 INFO L225 Difference]: With dead ends: 108 [2020-10-22 02:17:08,262 INFO L226 Difference]: Without dead ends: 85 [2020-10-22 02:17:08,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2020-10-22 02:17:08,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-22 02:17:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2020-10-22 02:17:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-22 02:17:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 139 transitions. [2020-10-22 02:17:08,266 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 139 transitions. Word has length 20 [2020-10-22 02:17:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:17:08,267 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 139 transitions. [2020-10-22 02:17:08,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-22 02:17:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 139 transitions. [2020-10-22 02:17:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 02:17:08,268 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:17:08,268 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:17:08,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 02:17:08,268 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:17:08,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:17:08,268 INFO L82 PathProgramCache]: Analyzing trace with hash -802155182, now seen corresponding path program 5 times [2020-10-22 02:17:08,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:17:08,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986145161] [2020-10-22 02:17:08,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:17:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:17:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:17:08,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986145161] [2020-10-22 02:17:08,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:17:08,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-22 02:17:08,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1768708806] [2020-10-22 02:17:08,667 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:17:08,671 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:17:08,685 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 41 transitions. [2020-10-22 02:17:08,685 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:17:08,758 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 02:17:08,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,763 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:17:08,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,764 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:17:08,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,766 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:17:08,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,767 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 02:17:08,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,771 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:08,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,780 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:08,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,791 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:08,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:08,796 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:17:08,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,797 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:08,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:08,806 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:08,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:08,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,820 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:17:08,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:08,822 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:08,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:08,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,837 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:08,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:17:08,855 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:17:08,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:08,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:08,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,871 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:17:08,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:08,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:08,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,888 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 02:17:08,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,889 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:17:08,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:08,891 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:08,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:08,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,904 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,905 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:08,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,914 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:17:08,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,919 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:17:08,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:08,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:08,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:08,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:08,943 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:08,945 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:09,183 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2020-10-22 02:17:09,207 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [10513#(and (= ~__unbuffered_p0_EAX~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0)), 10514#(and (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) 1) (= ~x$r_buff1_thd2~0 0) (or (= (mod ~x$w_buff0_used~0 256) 0) (= (mod ~x$r_buff0_thd3~0 256) 0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd2~0) (= (mod ~x$r_buff1_thd3~0 256) 0) (= ~__unbuffered_cnt~0 0))] [2020-10-22 02:17:09,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-22 02:17:09,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:17:09,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-22 02:17:09,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-10-22 02:17:09,209 INFO L87 Difference]: Start difference. First operand 73 states and 139 transitions. Second operand 16 states. [2020-10-22 02:17:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:17:09,681 INFO L93 Difference]: Finished difference Result 101 states and 185 transitions. [2020-10-22 02:17:09,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-22 02:17:09,681 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2020-10-22 02:17:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:17:09,682 INFO L225 Difference]: With dead ends: 101 [2020-10-22 02:17:09,683 INFO L226 Difference]: Without dead ends: 86 [2020-10-22 02:17:09,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-22 02:17:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-22 02:17:09,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2020-10-22 02:17:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-22 02:17:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 132 transitions. [2020-10-22 02:17:09,687 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 132 transitions. Word has length 20 [2020-10-22 02:17:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:17:09,687 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 132 transitions. [2020-10-22 02:17:09,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-22 02:17:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 132 transitions. [2020-10-22 02:17:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 02:17:09,688 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:17:09,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:17:09,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 02:17:09,689 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:17:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:17:09,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2013710096, now seen corresponding path program 6 times [2020-10-22 02:17:09,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:17:09,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417301306] [2020-10-22 02:17:09,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:17:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:17:10,298 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2020-10-22 02:17:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:17:10,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417301306] [2020-10-22 02:17:10,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:17:10,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-22 02:17:10,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [900639793] [2020-10-22 02:17:10,355 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:17:10,358 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:17:10,373 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 45 transitions. [2020-10-22 02:17:10,374 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:17:10,478 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2020-10-22 02:17:10,838 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 7, 3, 2, 1] term [2020-10-22 02:17:10,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:10,839 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 7, 1] term [2020-10-22 02:17:10,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:10,841 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:17:10,841 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:10,842 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:17:10,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:10,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:10,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:10,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:10,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:10,845 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:10,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:10,852 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:10,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:10,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:10,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:10,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:10,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:10,866 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:10,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:10,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:10,878 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:17:10,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:17:10,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:10,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:10,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:10,892 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:10,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:10,898 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:17:10,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:17:10,905 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 5, 7, 4, 2, 1] term [2020-10-22 02:17:10,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:17:11,313 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2020-10-22 02:17:11,314 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10775#(and (or (= (mod ~x$w_buff0_used~0 256) 0) (and (= ~x$r_buff1_thd2~0 0) (or (and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX~0 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= 0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= 0 ~x$w_buff1~0) (= |~#x~0.offset| 0))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd2~0)) (= (mod ~x$r_buff0_thd3~0 256) 0)) (or (and (= ~x$r_buff1_thd2~0 0) (or (and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= ~__unbuffered_p2_EAX~0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= 0 ~x$w_buff0~0)) (= (mod ~x$r_buff1_thd3~0 256) 0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd2~0) (or (and (<= ~x$w_buff0_used~0 0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= 0 ~x$w_buff0_used~0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= 0 ~x$w_buff0~0)) (and (= 0 ~x$w_buff1~0) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0)) (= |~#x~0.offset| 0)))) (and (not (= (mod ~x$r_buff0_thd3~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))))] [2020-10-22 02:17:11,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-22 02:17:11,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:17:11,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-22 02:17:11,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-22 02:17:11,315 INFO L87 Difference]: Start difference. First operand 72 states and 132 transitions. Second operand 12 states. [2020-10-22 02:17:11,668 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2020-10-22 02:17:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:17:12,150 INFO L93 Difference]: Finished difference Result 117 states and 203 transitions. [2020-10-22 02:17:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-22 02:17:12,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2020-10-22 02:17:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:17:12,151 INFO L225 Difference]: With dead ends: 117 [2020-10-22 02:17:12,152 INFO L226 Difference]: Without dead ends: 42 [2020-10-22 02:17:12,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2020-10-22 02:17:12,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-22 02:17:12,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-22 02:17:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-22 02:17:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 68 transitions. [2020-10-22 02:17:12,154 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 68 transitions. Word has length 20 [2020-10-22 02:17:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:17:12,154 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 68 transitions. [2020-10-22 02:17:12,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-22 02:17:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2020-10-22 02:17:12,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 02:17:12,155 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:17:12,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:17:12,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 02:17:12,155 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:17:12,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:17:12,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1143504162, now seen corresponding path program 7 times [2020-10-22 02:17:12,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:17:12,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565983391] [2020-10-22 02:17:12,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:17:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:17:12,240 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:17:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:17:12,360 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:17:12,421 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:17:12,422 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:17:12,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-22 02:17:12,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,479 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,480 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,480 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,481 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,481 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,481 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,482 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,482 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,482 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,485 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,485 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,485 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,487 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,487 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,487 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,487 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,487 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,488 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,488 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,488 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,489 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:17:12,489 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:17:12,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:17:12 BasicIcfg [2020-10-22 02:17:12,599 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:17:12,601 INFO L168 Benchmark]: Toolchain (without parser) took 25238.87 ms. Allocated memory was 138.9 MB in the beginning and 567.8 MB in the end (delta: 428.9 MB). Free memory was 99.8 MB in the beginning and 245.6 MB in the end (delta: -145.8 MB). Peak memory consumption was 283.1 MB. Max. memory is 7.1 GB. [2020-10-22 02:17:12,601 INFO L168 Benchmark]: CDTParser took 3.18 ms. Allocated memory is still 138.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 02:17:12,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.39 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 99.0 MB in the beginning and 151.7 MB in the end (delta: -52.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-10-22 02:17:12,603 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.16 ms. Allocated memory is still 202.4 MB. Free memory was 151.7 MB in the beginning and 149.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:17:12,604 INFO L168 Benchmark]: Boogie Preprocessor took 48.57 ms. Allocated memory is still 202.4 MB. Free memory was 149.0 MB in the beginning and 146.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:17:12,605 INFO L168 Benchmark]: RCFGBuilder took 3114.96 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 145.5 MB in the beginning and 178.6 MB in the end (delta: -33.0 MB). Peak memory consumption was 106.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:17:12,606 INFO L168 Benchmark]: TraceAbstraction took 21171.99 ms. Allocated memory was 248.5 MB in the beginning and 567.8 MB in the end (delta: 319.3 MB). Free memory was 176.5 MB in the beginning and 245.6 MB in the end (delta: -69.1 MB). Peak memory consumption was 250.2 MB. Max. memory is 7.1 GB. [2020-10-22 02:17:12,609 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.18 ms. Allocated memory is still 138.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.39 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 99.0 MB in the beginning and 151.7 MB in the end (delta: -52.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.16 ms. Allocated memory is still 202.4 MB. Free memory was 151.7 MB in the beginning and 149.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.57 ms. Allocated memory is still 202.4 MB. Free memory was 149.0 MB in the beginning and 146.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3114.96 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 145.5 MB in the beginning and 178.6 MB in the end (delta: -33.0 MB). Peak memory consumption was 106.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21171.99 ms. Allocated memory was 248.5 MB in the beginning and 567.8 MB in the end (delta: 319.3 MB). Free memory was 176.5 MB in the beginning and 245.6 MB in the end (delta: -69.1 MB). Peak memory consumption was 250.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 783 VarBasedMoverChecksPositive, 29 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 47 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.2s, 123 PlacesBefore, 34 PlacesAfterwards, 116 TransitionsBefore, 25 TransitionsAfterwards, 1562 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 106 TotalNumberOfCompositions, 4218 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_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5: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 t2270; [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5: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 t2271; [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5: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] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L811] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0) [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0 [L811] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0) [L811] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1) [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1 [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1) [L812] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x={5: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] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x={5: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=1] [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 [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x={5: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=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] 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) [L768] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L768] 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) [L768] 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) [L769] 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)) [L769] 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)) [L770] 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)) [L770] 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)) [L771] 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)) [L771] 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)) [L772] 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)) [L772] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L772] 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)) [L772] 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)) [L773] 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)) [L773] 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)) [L774] 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)) [L774] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L774] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L774] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L774] 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)) [L774] 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)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={5: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=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L789] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={5: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=2] [L792] 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) [L792] 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) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 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 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 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 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 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$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe020_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={5: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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 311 SDtfs, 312 SDslu, 961 SDs, 0 SdLazy, 1220 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=522occurred 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.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 39 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 59795 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...